|
Size: 1247
Comment:
|
Size: 1241
Comment:
|
| Deletions are marked like this. | Additions are marked like this. |
| Line 19: | 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]$)>> |
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($$|V|,|E|$$)]]
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]$)>>
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