Graph

Dennis Shasha

Omniheurist Course

Computer Science


 

Description

You are to design the largest planar graph you can that has diameter 5 and degree 5. To compute the diameter of a graph, consider the shortest path from any node to any other node of the graph. The diameter is the longest shortest path. The degree of a graph is the maximum number of neighbors any node in the graph can have.

Architecture and Random Spec