Question: Why does Johnsons algorithm add vertex s to V in its first step? Why not just use any existing vertex in the input graph? Explain,
Step by Step Solution
There are 3 Steps involved in it
Ans Johnsons algorithm is used for finding the shortest paths between all pairs of vertices in a wei... View full answer
Get step-by-step solutions from verified subject matter experts
