The Gateway to Computer Science Excellence
First time here? Checkout the FAQ!
x
0 votes
37 views

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 

asked in Algorithms by (357 points) | 37 views
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.

Please log in or register to answer this question.



Quick search syntax
tags tag:apple
author user:martin
title title:apple
content content:apple
exclude -tag:apple
force match +apple
views views:100
score score:10
answers answers:2
is accepted isaccepted:true
is closed isclosed:true

28,839 questions
36,693 answers
90,637 comments
34,642 users