= 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 ===
  
   * 22.1: RepresentingGraphs
   * BreadthFirstSearch
   * DepthFirstSearch

=== Applications ===

   * TopologicallySortingDag
   * Decomposing a graph into its StronglyConnectedComponents

== Chapter 23 ==

   * MinimumWeightSpanningTree
   * Minimum Spanning Trees are generally GreedyAlgorithms
   * KruskalAlgorithm
   * PrimAlgorithm

== Chapter 24-25 ==

   * 24: Shortest Path to all vertices from a single vertex
   * 25: AllPairsShortestPathProblem

== 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