Register

Topic - Dijkstra Algorithm Question 5a

• retagged by
489 views

Please log in or register to answer this question.

Voting & Accepting an answer helps improve the community
← PreviousNext →
← Previous in categoryNext in category →

Related questions

1 votes
1 votes
3 answers
1
ankit_thawal asked Jan 25, 2018
1,610 views
Dijkstra Algorithm
I think answer should be Option(B). Path:<s,y><y,x><x,t> = 7-3-2=2
I think answer should be Option(B).Path:<s,y><y,x><x,t = 7-3-2=2
User Avatar
0 votes
0 votes
0 answers
3
Elaf asked Jan 22, 2023
318 views
Dijkstra Algorithm
User Avatar
2 votes
2 votes
1 answer
4
srestha asked May 18, 2019
853 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
Link Copied!