Step through lazy Prim, then eager Prim: the same MST can emerge from very different queue histories.
02 · Test an assumption
Negative edges change which shortest-path algorithms apply. A reachable negative cycle means no finite optimum.
03 · Read the witness
Kruskal exposes its disjoint sets. Floyd–Warshall exposes its distance and next-hop matrices: hover a path to inspect it.
Algorithm Selection
Controls
Speed Control
Speed: 2
Visual Style
Floyd Visualization Mode
Simple: Dashed triangle (green/orange). Colorful: Glowing paths (green for winner, red for loser). Path Tracking: Shows actual shortest paths found so far. Hover to see paths from any node. (Path tracking is optional and unneeded if you only need the dist)
Graph Options
Graph Properties
Visualization
Start Node
The start node will be marked with a green circle ⭕
Algorithm Info
Dijkstra's Algorithm
Finds the shortest path from a source node to all other nodes in a weighted graph with non-negative weights.