In a grid graph, vertices are arranged in an \(n\)-by- \(n\) grid, with edges connecting each vertex to its neighbors above, below, to the left, and to the right in the grid. Compose a SmallWorld and Graph client that generates grid graphs and tests whether they exhibit the small-world phenomenon (first do EXERCISE 4.5.23).

Transcribed Image Text:

4.5.23 Add to Small World (PROGRAM 4.5.5) the function is Small World() that takes a graph as an argument and returns true if the graph exhibits the small-world phenomenon (as defined by the specific thresholds given in the text) and false otherwise.