Graph Theory
Visualize graph theory algorithms interactively. Draw nodes and edges, then run BFS, DFS, Dijkstra, and Kruskal on your graph.
Created by giggiox
Create a free account to get instant access
How to Use
This interactive tool lets you create graphs and visualize graph algorithms step-by-step. Creating graphs: • Click "vertex +" to add vertex mode, then click on canvas to place vertices • Click "edge +" to add edge mode, then click two vertices to connect them • Toggle switches for weighted edges (with numbers) or directed edges (with arrows) • Use "dice graph" for random graph or "trash graph" to clear all Running algorithms: 1. Choose algorithm from dropdown: BFS, DFS, Kruskal MST, or Dijkstra shortest-path 2. Select required vertices when prompted (some need 1 source, others need 2) 3. Click "visualize" button to watch algorithm animate Controls: • Mouse click to select vertices or place new ones depending on mode • Right dropdown shows graph representation (adjacency list/matrix) • Algorithms update in real-time if you modify the graph during visualization Note: Kruskal requires weighted, undirected graphs. Dijkstra requires weighted graphs.