Finding shortest / cheapest paths in a dense graph
Load node modules according to tsconfig paths, in run-time or via API.
Load modules according to tsconfig paths in webpack.
UnRS Resolver Node API
walk paths fast and efficiently
A lightweight cache for file metadata, ideal for processes that work on a specific set of files and only need to reprocess files that have changed since the last run
Get paths for storing things like data, config, cache, etc
The routing foundation of `serve`
Get the first path that exists on disk of multiple paths
prints a dependency graph in dot format for your typescript or react project
Enforces module path case sensitivity in Webpack
XState graph utilities
Convert Windows backslash paths to slash paths
A webpack plugin to enforce case-sensitive paths when resolving module
Vite resolver for TypeScript compilerOptions.paths
Determine (XDG-compatible) paths for storing application files (cache, config, data, etc)
Tests whether one path is inside another path
Determine common OS/platform paths (home, temp, ...)
Api paths of @mocks-server/plugin-admin-api
Simple dependency graph.
A babel plugin that combines babel-plugin-module-resolver and tsconfig-paths to resolve tsconfig paths
Cross-platform support for running Windows executables
Determine two file paths are equal
Universal filesystem path utils
A simple graph library with path planning.
m-Path graphs library
A* ruby implementation to find shortest path and map
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.
Make path of the recipe graph relative in itamae.
A graph implementation supporting Dijkstra's shortest path algorithm
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.
Allow the creation of an object that holds the steps through an object graph to retrieve a value(s).
Provides a simple way to find the shortest path in a graph of Rails records using Floyd's algorithm
Dijkstra's Algorithm For Shortest Path Directed Graph
Topological sorting, shortest path, and json exports for directed acyclic graphs
Build and resolve dependency graphs using topological sort, detect cycles, generate parallel execution batches, query dependencies and dependents, find shortest paths, and extract subgraphs.
No description provided.
No description provided.