Dijkstra, A*, D* Lite, vertex coloring, BFS/DFS. ← Back to hub
Build graph from edges [u, v, w]; run Dijkstra, A*, or D* Lite from source; show distances and path to target.
—
Greedy and DSatur coloring; bipartite check.
—
Breadth-first and depth-first traversal from a source.
—
4-connected grid with edge weights. Source (green S) = top-left, target (red T) = bottom-right. Edges colored by weight: green = low cost, red = high cost (e.g. 1000). Shortest path in blue. A* runs in Rust/WASM.
— new random weights (1–9 and some 1000 barriers).
—