Graph Laboratory (GR)
Explore topological properties, run Kahn's topological sorts, compute Kruskal MST paths, find cut vertices, and trace single-source shortest paths on weighted layouts.
All Graph Utilities (14)
BFS Traversal
Explore unweighted graph vertices layer-by-layer using FIFO queues.
DFS Traversal
Visualize recursive depth-first graph traversals tracing parent paths.
Dijkstra Solver
Compute single-source shortest paths on weighted graphs with non-negative edge costs.
Bellman-Ford Solver
Compute single-source shortest paths and detect negative cycle structures.
Floyd-Warshall Matrix
Calculate all-pairs shortest paths on weighted graphs using intermediate sweeps.
Topological Sort
Linear dependency ordering of Directed Acyclic Graphs (DAGs) using Kahn's algorithm.
Prim's MST
Construct a Minimum Spanning Tree greedily connecting closest neighbors.
Kruskal's MST
Construct a Minimum Spanning Tree by sorting edges and joining components with DSU.
DSU / Union-Find
Maintain partition of sets dynamically using union-by-rank and trace representatives.
Bipartite Checker
Verify bipartite properties by trying to two-color the graph nodes.
Critical Bridges
Detect critical bridge edges whose deletion disconnects the undirected graph.
Articulation Points
Identify critical cut-nodes whose deletion disconnects the undirected graph.
Kosaraju SCC
Extract strongly connected components (SCC) on directed graphs using dual DFS.
Graph Properties
Analyze graph statistics including degrees, density, connected components, cycles, DAG, and tree indicators.