Differences between revisions 12 and 13

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:

<<latex($G=(V,E)$)>>

The size of input has two components [[latex2()]]

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 <<latex($V[G]$)>> and the edges <<latex($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 12 as of 2014-11-11 16:49:08 → 
  Size: 1247
  Editor: scot
  Comment:
+   ← Revision 13 as of 2014-11-11 16:49:38 → ⇥
  Size: 1241
  Editor: scot
  Comment:
-Deletions are marked like this.
+Additions are marked like this.
 Line 19:
-Denote the set of vertices in graph G in pseudocode as  [[latex2($$V[G]$$)]] and the edges [[latex2($$E[G]$$)]]
+Denote the set of vertices in graph G in pseudocode as  <<latex($V[G]$)>> and the edges <<latex($E[G]$)>>