Graph Theory

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

See Also TreeStructures

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 (V E) = O (| V | * | E |)$

Denote the set of vertices in graph G in pseudocode as $V [G]$ and the edges $E [G]$

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