Graphs
Graph problems are so ubiquitous that its unimaginable to have a contest set without multiple graph based problems. To be successful, you must become comfortable working with graphs, representing them, transforming them, and executing well known algorithms on them.
What is a Graph
Graph Properties
Directionality
weightedness
Flow
Bipartite
DAGs
Trees
Graph Representation
Adjacency Matrix
Adjacency List
Implied Graphs
Standard Graph Algorithms
Topological Sort
Breadth First Search
==Depth First Search