Differences between revisions 8 and 10 (spanning 2 versions)

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 (V E) = 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 8 as of 2005-06-28 02:46:43 → 
  Size: 1261
  Editor: yakko
  Comment:
+   ← Revision 10 as of 2014-11-11 16:47:25 → ⇥
  Size: 1252
  Editor: 216
  Comment:
-Deletions are marked like this.
+Additions are marked like this.
 Line 17:
-[[latex2( $O (V E) = O (| V | * | E |)$ )]]
+[[latex( $O (V E) = O (| V | * | E |)$ )]]
 Line 19:
-To 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  [[latex2( $V [G]$ )]] and the edges [[latex2( $E [G]$ )]]
-Line 52:
+Line 50: