Differences between revisions 6 and 16 (spanning 10 versions)
Revision 6 as of 2004-10-25 22:46:21
Size: 1218
Editor: yakko
Comment:
Revision 16 as of 2020-01-23 22:56:28
Size: 1193
Editor: scot
Comment:
Deletions are marked like this. Additions are marked like this.
Line 4: Line 4:

'''See Also''' TreeStructures
Line 9: Line 11:
{{{
     G = (V,E)
}}}
$$G=(V,E)$$
Line 13: Line 13:
The size of input has two components

{{{
    |V|, |E|
}}}
The size of input has two components $$|V|,|E|$$
Line 21: Line 17:
{{{
     
O(VE) = O(|V|*|E|)
}}}
$$O(VE)=O(|V|*|E|)$$
Line 25: 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 59: Line 50:


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(VE)=O(|V|*|E|)$$

Denote the set of vertices in graph G in pseudocode as $$V[G]$$ and the edges $$E[G]$$

Chapter 22

Concepts

Applications

Chapter 23

Chapter 24-25

Chapter 26

  • 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

GraphTheoryPage (last edited 2020-01-23 22:56:28 by scot)