|
Size: 1173
Comment:
|
Size: 1218
Comment:
|
| Deletions are marked like this. | Additions are marked like this. |
| Line 41: | Line 41: |
| * Decomposing a graph into its StronglyConnectComponents | * Decomposing a graph into its StronglyConnectedComponents |
| Line 47: | Line 47: |
| * KruskalAlgorithm * PrimAlgorithm |
Graph Theory
This page contains over view information and links to concepts covered in "Intro to Algorithms" by Cormen, Leiserson & Rivest.
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|)
To denote the set of vertices in graph G in pseudocode as
V[G] and the edges E[G]
Chapter 22
Concepts
Applications
Decomposing a graph into its StronglyConnectedComponents
Chapter 23
Minimum Spanning Trees are generally GreedyAlgorithms
Chapter 24-25
- 24: Shortest Path to all vertices from a single vertex
Chapter 26
This general problem arises in many forms and a good algorithm for computer MaxFlow can be used to solve a variety of related problems