0 votes 0 votes How to understand this: For a connected graph, V = O(E)) SOURCE http://www.geeksforgeeks.org/greedy-algorithms-set-5-prims-mst-for-adjacency-list-representation/ prims algorithm time complexity for adjacency list representation. Also same is given in CLRS but no reason Algorithms prims-algorithm clrs + – Anshul Shankar asked Sep 11, 2017 Anshul Shankar 406 views answer comment Share Follow See all 2 Comments See all 2 2 Comments reply vivek9837 commented Sep 12, 2017 reply Follow Share 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)$ 0 votes 0 votes Anshul Shankar commented Sep 12, 2017 reply Follow Share Thanks but can you share some resources to understand it better. 0 votes 0 votes Please log in or register to add a comment.