Skip to content

Chapter 9: Unweighted Graph Algorithms

9.1 Representation of Graph

Adjacency Matrix

Adjacency List

Comparison

Pseudocode

Properties

Classification of Edge

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