A graph whose edges are ordered pairs of vertices. That is, each edge can be followed from one vertex to another vertex. Formal Definition: A graph G is a pair (V,E), where V is a set of vertices, and E is a set of edges between the vertices E ⊆ ((u,v)