A graph G is formally defined as a set G(V,E) where:

• V is a set of vertices (or nodes).

• E is a set of edges between nodes usually specified as a pair of vertices.

If an edge is directed, then there is a start vertex and end vertex (e.g. an arrow).