A *graph* *G*
is defined as pair of sets (*V*,*E*) where
*V* is a finite set and *E* is a subset consisting of
pairs of elements from *V*.
The elements of *V* are called the *vertices* of *G*
and the elements of *E* are called the *edges* of *G*.

This diagram represents a graph with 10 vertices and 13 edges.

*Back to the Parallel Mountain Climbers problem**
*