graph-theory
Graph traversal -- BFS and DFS
taught
Taught in
-
Breadth-first search
Graph Theory
-
Depth-first search
Graph Theory
-
DFS edge classification: tree edges and back edges
Graph Theory
-
Traversal order and discovery/finish times
Graph Theory
-
BFS vs. DFS, compared
Graph Theory
-
Using traversal to test connectivity
Graph Theory
-
Applications: maze-solving and dependency discovery
Graph Theory
Requires
- what-a-graph-is required
- tree-traversal required
Required by
- BFS and shortest paths in unweighted graphs required
- Dijkstra's algorithm required
- Strongly connected components required
Local knowledge map
Local knowledge map
Click to expand
Solid arrows are required prerequisites; dashed are recommended or helpful. Lower rows are more foundational. Click any box to jump to that concept.