Differences between revisions 7 and 16 (spanning 9 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:

$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

-  ⇤ ← Revision 7 as of 2004-10-25 23:51:12 → 
  Size: 1251
  Editor: yakko
  Comment:
+   ← Revision 16 as of 2020-01-23 22:56:28 → ⇥
  Size: 1193
  Editor: 68
  Comment:
-Deletions are marked like this.
+Additions are marked like this.
 Line 11:
-{{{
     G = (V,E)
}}}
+ $G = (V, E)$
-Line 15:
+Line 13:
-The size of input has two components

{{{
     |V|, |E|
}}}
+The size of input has two components $$|V|,|E|$$
-Line 23:
+Line 17:
-{{{
     O(VE) = O(|V|*|E|)
}}}
+$$O(VE)=O(|V|*|E|)$$
-Line 27:
+Line 19:
-To denote the set of vertices in graph G in pseudocode as 
{{{
     V[G] and the edges E[G]
}}}
+Denote the set of vertices in graph G in pseudocode as  $$V[G]$$ and the edges $$E[G]$$
-Line 61:
+Line 50: