Analysis - Counting Method
- Two stages:
  1. Determine how many expansions will be required.
  2. Use that value to formulate summations, i.e. low and hi bounds, via knowledge from Part 1

Graphs
- Nodes and edges that connect them.

A graph G is a tuple (V, E) where
V is a set of vertices or nodes 
E is a set of edges
An Edge e is a pair (v1,v2), where vi ε V