Differences between revisions 4 and 5
⇤ ← Revision 4 as of 2004-10-25 22:42:42 →
Size: 1173
Editor: yakko
Comment:
← Revision 5 as of 2004-10-25 22:44:16 → ⇥
Size: 1175
Editor: yakko
Comment:
Deletions are marked like this. Additions are marked like this.
Line 41: Line 41:
   * Decomposing a graph into its StronglyConnectComponents    * Decomposing a graph into its StronglyConnectedComponents

Graph Theory

This page contains over view information and links to concepts covered in "Intro to Algorithms" by Cormen, Leiserson & Rivest.

Notation

A graph is usually specified by: 

     G = (V,E)

The size of input has two components 

     |V|, |E|

In AsymptoticNotation we abuse the notation for size by writing 

     O(VE) = O(|V|*|E|)

To denote the set of vertices in graph G in pseudocode as 

     V[G] and the edges E[G]

Chapter 22

Concepts

Applications

Chapter 23

Chapter 24-25

Chapter 26

  • MaxFlowNetwork

  • This general problem arises in many forms and a good algorithm for computer MaxFlow can be used to solve a variety of related problems

GraphTheoryPage (last edited 2020-01-23 22:56:28 by scot)