GATE CSE
First time here? Checkout the FAQ!
x
0 votes
28 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 (199 points)   | 28 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.



Top Users Sep 2017
  1. Habibkhan

    8586 Points

  2. rishu_darkshadow

    3046 Points

  3. Warrior

    2862 Points

  4. Arjun

    2796 Points

  5. A_i_$_h

    2546 Points

  6. manu00x

    2116 Points

  7. nikunj

    1990 Points

  8. Bikram

    1874 Points

  9. makhdoom ghaya

    1820 Points

  10. SiddharthMahapatra

    1718 Points


26,301 questions
33,864 answers
80,437 comments
31,203 users