Documentation
This visualization tool allows you to explore different graph structures and algorithms with interactive controls.
You can select from various graph types including Random Graph, Tree, Rectangular Grid, Triangular Grid, Hexagonal Grid,
Ring, Butterfly, Hypercube Graph, and Bipartite Graph. Each type creates a different network topology for visualization.
The tool visualizes graph traversal using Depth-First Search (DFS) and shows port numbers at each node.
Port numbers are used to determine which edge a node should follow next, which is common in distributed algorithms.
The current traversal edge is highlighted in orange, while visited edges are colored green and back edges are colored red.
Controls: Use the Graph Type dropdown to select different structures. Adjust the Number of Nodes slider to change graph size.
Select either Depth-First Search (DFS) or Breadth-First Search (BFS) from the Traversal Algorithm dropdown.
Click Start Traversal to automatically animate the traversal, or use Next/Previous Step buttons to navigate manually.
Toggle Manual Mode to click on edges directly, and use Undo to revert actions.