Graph Visualizer

Add node

Add node

Add edge

Add edge

Delete node

Delete node

Delete edge

Delete edge

Breadth-first search O(V+E)

Run BFS

Depth-first search O(V+E)

Run DFS

Dijkstra — non-negative weights O((V+E)logV)

Run Dijkstra

Bellman-Ford — handles negative weights O(V·E)

Run Bellman-Ford

Kruskal MST — with Union-Find O(E logE)

Works on undirected graphs (edges treated as undirected).

Run Kruskal MST

Tarjan SCC — strongly connected components O(V+E)

Directed graphs only. Each SCC shown in a distinct colour.

Run Tarjan SCC

Cycle detection O(V+E)

Uses directed or undirected rules based on current mode.

Check for cycle

Topological sort — Kahn's algorithm O(V+E)

Directed acyclic graphs only.

Topological sort