# Self Doubt (Graphs)

141 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

0
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
Thanks but can you share some resources to understand it better.

## Related questions

1
558 views
On other sources, it is given that we need to assign high priorities to newly inserted element in case of stack otherwise low priority to newly inserted element in case of queue. My doubt here is that shouldn't stack be implemented with max-heap priority queue and queue with min-heap priority queue keeping above assumption of assigning priorities to newly inserted element?
For a sparse graph $G=(V,E)$ where $|E|=\Theta (V)$ ... Plz tell me difference between Sparse and Dense graph here? How Dense graph implemented and how it make difference for this question