Analysis of Algorithms
University of South Carolina
November 30, 2010
Strongly Connected Components
We will represent a graph G = (V , E) in pseudocode as vertex set
by G.V and edge set by G.E.
G may be either directed or undirected.
Two common ways to represent graphs for algorithms:
1. Adjacency lists.