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


Shortest path: By length or by cost.

Dijkstra Shortest Path
- Find shortest path to all vertices in a graph from a single source node.