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
64.3k questions
77.9k answers
244k comments
80.0k users