> What is the time complexity of finding the diameter of a graph
> $G=(V,E)$?
> 
>  - ${O}(|V|^2)$
>  - ${O}(|V|^2+|V| \cdot |E|)$
>  - ${O}(|V|^2\cdot |E|)$
>  - ${O}(|V|\cdot |E|^2)$

The diameter of a graph $G$ is the largest of shortest path distances between all pairs of vertices in a graph.

I have no idea what to do about it, I need a complete analysis on how to solve a problem like this.