given an input character set, create an iterator function that returns the next shortest string available
Shortest path functions for graphology.
Returns the shortest path from start to end without colliding with any Feature in obstacles.
A simple JavaScript implementation of Dijkstra's single-source shortest-paths algorithm.
Get the shortest leading whitespace from lines in a string
Given some data, jsesc returns the shortest possible stringified & ASCII-safe representation of that data.
A JavaScript library for escaping CSS strings and identifiers while generating the shortest possible ASCII-only output.
Gets the shortest directory to which a file can be linked
Find shortest path through a network of GeoJSON
dynamic shortest path algorithim
Solves minimum-cost flow problems using the successive shortest paths algorithm
Computes the K shortest paths in a graph from node s to node t using Yen's algorithm
Shortest path strategies in JS
Shortest sea route between any two points on Earth. TypeScript library with the Eurostat 2025 maritime network, canal/strait restrictions (Suez, Panama, Bab-el-Mandeb…), vessel-draft gating, K-shortest alternatives, multi-leg waypoints, and ETA from vesse
ESLint plugin to prefer the shortest import path (relative vs alias)
A package to calculate the shortest sea route between two points on Earth.
Flug: The Test Runner with the Shortest Time to Takeoff
Algorithm for finding shortest paths in a weighted graph with positive or negative edge weights (but with no negative cycles)
AI-powered natural language end-to-end testing framework
Finding shortest / cheapest paths in a dense graph
Fast shortest path finder for grids
Simple and fast library for graphs and calculating shortest paths
Fast shortest CSS color converter (Rust+WASM)
A JavaScript library for escaping JavaScript strings while generating the shortest possible valid output.
Pathfinding library for calculating all node pairs' shortest paths in an unweighted undirected graph.
A Rust library for shortest path finding algorithms, including Dijkstra's, A*, and Bellman-Ford. Supports both directed and undirected graphs, with customizable heuristics and edge weights. Ideal for game development, network routing, and graph analysis.
A Rust library for finding shortest paths in weighted graphs using Dijkstra's algorithm with multiple heap implementations
contains data structures used within the icentral system for counting all pairs shortest paths
CLI for shortest-color — convert CSS colors to their shortest representation
Fast shortest path calculations on directed graphs made possible by pre-processing the graph using Contraction Hierarchies
rustgym solutions
A simple Floyd-Warshall algorithm implementation
Random passphrase generator
Color shortener
Shortest Path is an experimental library finding the shortest path from A to B.
Shortest brainfuck for given string
A* ruby implementation to find shortest path and map
ruby gem for finding shortest path
provides longest shortest shell commands
Provides a simple way to find the shortest path in a graph of Rails records using Floyd's algorithm
A CLI to facilitate easy, unified development workflows for Puppet modules.
App pare Shortest Path
A Ruby object-oriented search library for directed and undirected graphs based loosely on Dijkstra's algorithm
Graph data structure supporting directed and undirected modes with adjacency list storage. Includes BFS, DFS, Dijkstra shortest path, topological sort, cycle detection, connected components, minimum spanning tree, maximum flow, graph coloring, bipartiteness checking, strongly connected components, and DOT/JSON serialization.
A graph implementation supporting Dijkstra's shortest path algorithm
A CLI to facilitate easy, unified development workflows for Puppet modules.
Implements Dijkstra's algorithm to find the shortest path in a graph. The cost of an edge can be more general than just a numeric value.
Dijkstra's Algorithm For Shortest Path Directed Graph
No description provided.
No description provided.
No description provided.
No description provided.
No description provided.
No description provided.
No description provided.
No description provided.
No description provided.
No description provided.
No description provided.
No description provided.
No description provided.
No description provided.
No description provided.
No description provided.
No description provided.
No description provided.
No description provided.
No description provided.