8.24. Key TermsΒΆ

acyclic graph adjacency list adjacency matrix
adjacent breadth first search (BFS) cycle
cyclic graph DAG depth first forest
depth first search (DFS) digraph directed acyclic graph (DAG)
directed graph edge cost edge
parenthesis property path shortest path
spanning tree strongly connected components (SCC) topological sort & uncontrolled flooding
vertex weight  
Next Section - 8.25. Discussion Questions