Quick Guide
- Click empty space to Add Node
- Move Mode: Drag nodes
- Connect Mode: Drag A to B
- Double Click Node/Edge to delete
Algorithm Library
Shortest Path
Dijkstra: Best for non-negative weights. Uses Priority Queue.
Bellman-Ford: Handles negative weights. Detects negative cycles.
Floyd-Warshall: Computes paths between all pairs of nodes (Dynamic Programming).
Minimum Spanning Tree
Prim's: Grows a tree from a start node. Good for dense graphs.
Kruskal's: Adds smallest edges globally if they don't form a cycle. Uses Union-Find.
Connectivity
Tarjan's: Finds Strongly Connected Components (SCCs) in one DFS pass using low-link values.
Union-Find: Efficiently tracks connected components and cycles in undirected graphs.
Flow & Analysis
Max Flow (Edmonds-Karp): Finds maximum capacity from Source to Sink using BFS for augmenting paths.
Topological Sort (Kahn's): Linear ordering of DAG vertices based on dependencies.