AlgoViz.
Graph Algorithms Hub

Graph Algorithms & Network Topologies

Interact with dynamic node positioning, weighted edge relaxation, Dijkstra shortest-path calculations, and animated BFS/DFS graph traversals.

Explore Graph VisualizersAll Data Structures

Graph Visualizers & Traversal Algorithms

Launch interactive graph workbenches with draggable nodes, edge weights, and live shortest-path metrics.

Interactive Graph Workbench (BFS, DFS, Dijkstra)

Interactive 2D

Fully interactive graph workspace supporting node creation, drag-and-drop coordinate positioning, directed/undirected edges, edge weight assignment, adjacency matrix/list inspection, and step-by-step BFS, DFS, and Dijkstra shortest path finding with edge relaxation.

Best for: Shortest path routing, social graph modeling, and network topology analysis.

Breadth-First Search (BFS)

Traversal

Level-by-level queue-based traversal discovering all equidistant neighbors before moving deeper. Guarantees the shortest path on unweighted graphs.

Best for: Peer-to-peer networks, crawling web spiders, and finding connected components.

Depth-First Search (DFS)

Traversal

Recursive or stack-based traversal that advances along a branch as far as possible before backtracking. Essential for cycle detection and topological sorting.

Best for: Maze solving, topological ordering in build systems, and strongly connected components.