Dijkstra Bellman-Ford Prim's MST Kruskal's MST
Design Graph → Press Next
Define Custom Directed Routing Network:
Dijkstra State Tracking Table
Step Selected Vertex (u) Unvisited Set (V - S) Distance Array Matrix

Dynamic Node Rendering

While you can select routing paths spanning from A to Z using the dropdowns below, the simulation canvas will now strictly filter and render only the active nodes that exist in your custom-defined graph network.

The canvas utilizes an automatic elliptical geometry algorithm. As you add or remove unused nodes, the active nodes adjust their coordinate radius dynamically to ensure paths do not clutter or overlap visually.

Evaluation Rules

When computing, the algorithm fetches all active outbound paths originating from your currently selected vertex. If traveling through the current node minimizes the total traversal cost to the target neighbor, the edge is recorded in the matrix and visualized in cyan.