Register

Dijkstra

• retagged by
834 views
1 votes
1 votes

Which of the following procedure results same output as Dijkstra’s algorithm on unweighted graph with ‘n’ vertices ?

a) BFS

b) DFS

c) Kruskal

d) Prims

• retagged by
User Avatar

1 Answer

Best answer
4 votes
4 votes
Answer is A) BFS.

Dijkstra and bfs work on same approach, it is just that dijkstra's gives repect to edge weight, when unweighted graph both are same.
• selected by
User Avatar
Voting & Accepting an answer helps improve the community
← PreviousNext →
← Previous in categoryNext in category →

Related questions

2 votes
2 votes
1 answer
1
srestha asked May 18, 2019
839 views
Made Easy Test Series:Algorithm-Dijkstra
Which of the following procedure results same output as Dijkstra’s Algo. on unweighted graph on $'n'$ verices? $A)$ BFS $B)$ DFS $C)$Kruskal $D)$ Prims As far I know Dijkstra and Prims both have $T.C.=O(E+VlogV)$ But ans given BFS. How this ans possible??
Which of the following procedure results same output as Dijkstra’s Algo. on unweighted graph on $'n'$ verices?$A)$ BFS $B)$ DFS $C)$Kruskal $D)$ PrimsAs far I know ...
User Avatar
1 votes
1 votes
1 answer
3
Souvik33 asked Dec 19, 2022
700 views
Dijkstra's algorithm | Negative Weight Cycle
If a -ve weight cycle is reachable from source, the Dijkstra's algorithm gets into an infinite loop TRUE FALSE
If a -ve weight cycle is reachable from source, the Dijkstra's algorithm gets into an infinite loop TRUEFALSE
User Avatar
Link Copied!