+1 vote
in Data Structures & Algorithms I by (88.2k points)
Time complexity to find if there is an edge between 2 particular vertices is _________

(a) O(V)

(b) O(E)

(c) O(1)

(d) O(V+E)

My question is taken from Adjacency List in portion Graph of Data Structures & Algorithms I

The question was asked in exam.

1 Answer

+1 vote
by (737k points)
selected by
 
Best answer
Correct option is (a) O(V)

For explanation: The maximum edges a vertex can have is V-1.

Related questions

Welcome to TalkJarvis QnA, a question-answer community website for the people by the people. On TalkJarvis QnA you can ask your doubts, curiosity, questions and whatever going in your mind either related to studies or others. Experts and people from different fields will answer.

Categories

...