I'm finding distance and diameter confusing in graph theory. Distance is the smallest path between two vertices. Diameter is the largest smallest path? Is it possible for a connected graph to have a diameter greater than the largest distance between any two vertices?
"largest distance between any two vertices" is an alternative definition for diameter.
At least when the graph is connected, but talking about diameter in unconnected graphs is not common.