Module 3
Graph Theory
Build and explore graphs interactively. Run BFS and DFS traversals, find shortest paths with Dijkstra's algorithm, and inspect the adjacency matrix.
Graph Builder & BFS / DFS
Drag nodes to reposition them.
Traversal
6
Nodes |V|
6
Edges |E|
Yes
Connected
Yes
Has Cycle
Adjacency Matrix
| A | B | C | D | E | F | |
|---|---|---|---|---|---|---|
| A | 0 | 1 | 1 | 0 | 0 | 0 |
| B | 1 | 0 | 0 | 1 | 1 | 0 |
| C | 1 | 0 | 0 | 0 | 1 | 1 |
| D | 0 | 1 | 0 | 0 | 0 | 0 |
| E | 0 | 1 | 1 | 0 | 0 | 0 |
| F | 0 | 0 | 1 | 0 | 0 | 0 |
Dijkstra's Shortest Path
Dijkstra's Shortest Path
Select source and target nodes, then run the algorithm
Source:
Target: