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??
What about Prims??
Dijkstra work on all direction like BFS.
right?? but why not Prims??
Unweighted means no edge weight, then why take each edge weight as 1??