Which of the following is the definition of the 'diameter' of a graph?
The number of edges in the longest cycle
The maximum shortest path distance between any two vertices
The total number of paths in the graph
The number of vertices in the largest complete subgraph