Differences between revisions 10 and 11

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:

The size of input has two components [[latex2($$|V|,|E|$$)]]

In AsymptoticNotation we abuse the notation for size by writing

<<latex($O(VE)=O(|V|*|E|)$)>>

Denote the set of vertices in graph G in pseudocode as latex2($$V[G]$$) and the edges latex2($$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

-  ⇤ ← Revision 10 as of 2014-11-11 16:47:25 → 
  Size: 1252
  Editor: scot
  Comment:
+   ← Revision 11 as of 2014-11-11 16:48:41 → ⇥
  Size: 1250
  Editor: scot
  Comment:
-Deletions are marked like this.
+Additions are marked like this.
 Line 17:
-[[latex($$O(VE)=O(|V|*|E|)$$)]]
+<<latex($O(VE)=O(|V|*|E|)$)>>