what is the union of all shortest path tree and edge in one example

Question

Consider Union of shortest path trees for each vertexes on connected and undirected Graph G. order (number) of edges in this union at worst case is O(n^2