A.08Reference2 topics
Graph traversal complexity
Part of Chapter A: Algorithm and Data Structure Complexity Reference.
Outline only
The topics below come from the curriculum. Their written explanations and animations have not been published yet.
A.08.1
BFS/DFS O(V+E) adjacency list
Explanation coming soon.
A.08.2
Dense adjacency matrix may incur O(V²)
Explanation coming soon.