Graph Algorithm Visualizers

Trace graph traversal, shortest paths, minimum spanning trees, dependency ordering, grid movement, and disjoint-set operations with visual step output.

Use this hub when relationships are the input

These tools model vertices connected by edges, or grid cells connected to neighbours. Start by deciding whether you need reachability, one route, every route, dependency order, or a minimum-cost network.

Working with arrays or recurrence states? Use the general algorithm hub for search, sorting, windows, and DP.Working with characters and patterns? Use the string hub for exact matching and string dynamic programming.Practising graph storage operations? Use the data-structure hub for graph, union-find, queue, and heap mechanics.

Choose a graph algorithm by the result you need

Graph algorithms answer different questions. Pick traversal, shortest path, dependency order, or minimum spanning tree before choosing a tool.

Visit reachable nodes

Use BFS or DFS for reachability, traversal order, and connected exploration; use matrix traversal for the same ideas on a grid.

Graph BFS DFS Visualizer Matrix Traversal Visualizer

Find a shortest path

Use Dijkstra for non-negative weighted edges, A Star for a heuristic grid route, Bellman Ford for negative edges, or Floyd Warshall for all pairs.

Dijkstra Algorithm Visualizer A Star Pathfinding Visualizer Bellman Ford Visualizer Floyd Warshall Visualizer

Order dependencies

Use topological sort when directed edges express prerequisites and every dependency must appear before its dependent node.

Topological Sort Visualizer

Connect nodes at minimum cost

Use Kruskal or Prim for a minimum spanning tree, and union find to inspect how components merge.

Kruskal Algorithm Visualizer Prim Algorithm Visualizer Union Find Visualizer

Compare graph algorithms before choosing one

Edge weights, the number of sources and destinations, and whether the graph is acyclic determine which algorithm fits.

Visualizer	Best for	Important constraint	Typical time
Graph BFS DFS Visualizer	Reachability, traversal order, and connected exploration	BFS gives unweighted shortest paths; DFS does not	O(V + E)
Dijkstra Algorithm Visualizer	Single-source shortest paths with non-negative weights	Do not use it when a reachable edge has a negative weight	O((V + E) log V)
Bellman Ford Visualizer	Shortest paths with negative edges or cycle detection	It is slower because every edge may be relaxed repeatedly	O(V × E)
A Star Pathfinding Visualizer	One goal-directed route when a useful heuristic is available	A poor heuristic removes much of the search advantage	Problem-dependent
Floyd Warshall Visualizer	Shortest paths between every pair of vertices	The cubic table cost is unsuitable for large sparse graphs	O(V³)
Topological Sort Visualizer	Ordering prerequisites in a directed acyclic graph	A directed cycle means no topological order exists	O(V + E)

Traversal and grid search

Explore queues, stacks, visited sets, grid neighbors, and the order in which graph and matrix nodes are processed.

Graph BFS DFS Visualizer Visualize graph BFS and DFS traversal online. Paste an edge list, choose a start node, and compare breadth-first and depth-first visit order. Matrix Traversal Visualizer Visualize matrix traversal online. Paste a grid, run spiral order or grid BFS, and inspect visited cells, frontier cells, and traversal order. A Star Pathfinding Visualizer Visualize A* pathfinding online. Paste a grid with walls, choose a heuristic, and step through open set, closed set, g, h, f, and final path. Topological Sort Visualizer Visualize topological sorting online. Paste directed edges, run Kahn or DFS order, inspect in-degrees, queue updates, and cycle detection.

Shortest paths

Compare non-negative weighted search, heuristic pathfinding, negative-edge handling, and all-pairs shortest paths.

Dijkstra Algorithm Visualizer Visualize Dijkstra shortest path search online. Paste weighted graph edges, choose start and target nodes, and step through distance updates. A Star Pathfinding Visualizer Visualize A* pathfinding online. Paste a grid with walls, choose a heuristic, and step through open set, closed set, g, h, f, and final path. Bellman Ford Visualizer Visualize Bellman-Ford shortest paths online. Paste directed weighted edges, keep negative weights, and step through relaxation and cycle checks. Floyd Warshall Visualizer Visualize Floyd-Warshall all-pairs shortest paths online. Paste directed weighted edges and step through the distance matrix updates.

Minimum spanning trees and components

See edge sorting, frontier growth, component merging, and disjoint-set operations in connected graph problems.

Kruskal Algorithm Visualizer Visualize Kruskal MST construction online. Paste weighted edges, sort by weight, and step through union-find cycle checks. Prim Algorithm Visualizer Visualize Prim minimum spanning tree construction online. Paste weighted edges, choose a start node, and step through frontier edge choices. Union Find Visualizer Visualize union find and disjoint set operations online. Create nodes, union sets, find roots, and inspect parent links, ranks, and connected components.

Related tool hubs

Algorithm Visualizers Use free algorithm visualizers for sorting, binary search, sliding window, dynamic programming, backtracking, graph algorithms, and string matching.String Algorithm Visualizers Use free string algorithm visualizers for KMP, Rabin Karp, Z algorithm, edit distance, and longest common subsequence.Data Structure Visualizers Use free data structure visualizers for lists, stacks, queues, trees, graphs, arrays, recursion, DP, sorting, and algorithm patterns.

Graph Algorithm Visualizers FAQ

Which graph visualizer shows BFS and DFS?

Use the Graph BFS DFS Visualizer to compare breadth-first search and depth-first search order on a graph.

Which visualizer should I use for shortest paths?

Use Dijkstra for non-negative weighted graphs, A Star for heuristic grid pathfinding, Bellman Ford for negative edges, and Floyd Warshall for all-pairs shortest paths.

Do the graph visualizers run in the browser?

Yes. The visualizers run as browser tools on RavensMove and are designed for small learning inputs that are easy to inspect.