Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
Analysis of Algorithms Max Alekseyev
 

Summary: 1/27
Analysis of Algorithms
Lecture 21
Max Alekseyev
University of South Carolina
November 30, 2010
2/27
Outline
Graph Algorithms
Breadth-first Search
Depth-first Search
Topological Sort
Strongly Connected Components
3/27
Graph Representations
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.

  

Source: Alekseyev, Max - Department of Computer Science and Engineering, University of South Carolina

 

Collections: Biotechnology; Computer Technologies and Information Sciences