Let G be a graph with V vertices and E edges. The Time complexity to find if there is an edge between 2 particular vertices with an adjacency list representation is: ~V ~1 ~V+E ~E

icon
Related questions
Question
Let G be a graph with V vertices and E edges. The Time complexity to find if there is
an edge between 2 particular vertices with an adjacency list representation is:
~V
~1
~V+E
~E
Transcribed Image Text:Let G be a graph with V vertices and E edges. The Time complexity to find if there is an edge between 2 particular vertices with an adjacency list representation is: ~V ~1 ~V+E ~E
Expert Solution
steps

Step by step

Solved in 2 steps

Blurred answer