In an unweighted undirected connected graph the shortest path from a node S to every other node is computed most efficiently in terms of time complexity by computer science gate 2007

The Eduladder is a community of students, teachers, and programmers just interested to make you pass any exams. So we solve previous year question papers for you.
See Our team
Wondering how we keep quality?
Got unsolved questions?

## In an unweighted, undirected connected graph, the shortest path from a node S to every other node is computed most efficiently, in terms of time complexity, by -computer science-gate-2007

In an unweighted, undirected connected graph, the shortest path from a node S to every other node is computed most efficiently, in terms of time complexity, by
(A) Dijkstras algorithm starting from S.
(8) Warshalls algorithm.
(C) performing a DFS starting from S.
(D) performing a 8FS starting from S.

Taged users:

Likes:
Be first to like this question

Dislikes:
Be first to dislike this question

(D) performing a BFS starting from S.

Explanation:

• Time Comlexity of the Dijkstra’s algorithm is O(|V|^2 + E)
• Time Comlexity of the Warshall’s algorithm is O(|V|^3)
• DFS cannot be used for finding shortest paths
• BFS can be used for unweighted graphs. Time Complexity for BFS is O(|E| + |V|)

Likes:
Be first to like this answer

Dislikes:
Be first to dislike this answer

You may also like our videos

Below are some of the videos from our collection. We saw that students not only needed content but also videos. So, we decided to build a video platform for you also an algorithm which shows best videos suites to you related to the content you are browsing check out some videos which suit best for you.

Lets together make the web is a better place

We made eduladder by keeping the ideology of building a supermarket of all the educational material available under one roof. We are doing it with the help of individual contributors like you, interns and employees. So the resources you are looking for can be easily available and accessible also with the freedom of remix reuse and reshare our content under the terms of creative commons license with attribution required close.

You can also contribute to our vision of "Helping student to pass any exams" with these.