Chapter 9: Unweighted Graph Algorithms
9.1 Representation of Graph
Adjacency Matrix
Adjacency List
Comparison
9.2 Depth First Search
Pseudocode
Properties
Classification of Edge
9.3 Breadth First Search
Pseudocode
Example
Correctness
Analysis
Usage
9.4 Classical Graph Problems
Directed graph cycle detection
Topological Sort of Directed Graph
Strongly Connected Components in Directed Graphs
Articulation Vertex
Bridge
Diameter