Differences between revisions 7 and 8

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

[[latex2($$O(VE)=O(|V|*|E|)$$)]]

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

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 7 as of 2004-10-25 23:51:12 → 
  Size: 1251
  Editor: yakko
  Comment:
+   ← Revision 8 as of 2005-06-28 02:46:43 → ⇥
  Size: 1261
  Editor: yakko
  Comment:
-Deletions are marked like this.
+Additions are marked like this.
 Line 11:
-{{{
     G = (V,E)
}}}
+[[latex2($$G=(V,E)$$)]]
-Line 15:
+Line 13:
-The size of input has two components

{{{
     |V|, |E|
}}}
+The size of input has two components [[latex2($$|V|,|E|$$)]]
-Line 23:
+Line 17:
-{{{
     O(VE) = O(|V|*|E|)
}}}
+[[latex2($$O(VE)=O(|V|*|E|)$$)]]
-Line 28:
+Line 20:
-{{{
     V[G] and the edges E[G]
}}}
+[[latex2($$V[G]$$)]] and the edges [[latex2($$E[G]$$)]]
-Line 62:
+Line 53: