Consider any given undirected unweighted graph $G=(V,E).$ The diameter of $G$ is defined as the maximum shortest distance between any pair of vertices $u$ and $v.$ The following algorithm will find the diameter for $G$ :

Call Dijkstra's algorithm starting with any given vertex $u$ to find a shortest path to every other vertex. The longest path from $u$ to some vertex is the diameter of $G.$

True

False