1) Dijkstra’s algorithm finds the shortest paths from a sourcevertex s to all other vertices. It works for unweighted graphs aswell (just let them all have the same weight). But in an unweightedgraph, we can find the shortest paths (in this case in terms of thenumber of edges) with a traversal. Will both depth-first andbreadth-first work for this task? Explain
Expert Answer
An answer will be send to you shortly. . . . .