28 views

How to understand this: For a connected graph, V = O(E))

prims algorithm time complexity for adjacency list representation. Also same is given in CLRS but no reason

It means that the in a connected graph the no. of vertices can never exceed the no. of edges because minimum edges in a connected graph of $n$ nodes will be $O(n)$ and maximum no of edges will be $O(n^2)$
Thanks but can you share some resources to understand it better.