Counting The Important Pairs

[a simple graph is an undirected graph that has no loops (edges connected at both ends to the same vertex) and no more than one edge between any two different vertices.] -Retrieved from http://en.wikipedia.org/wiki/Graph_(mathematics) The road system at Byteland can be seen as a simple graph in which the vertices represented by the cities and the edges represented by the roads connected two dif