given graph:

QUESTION 1 IS SOLVED AT THIS LINK :

https://www.chegg.com/homework-help/questions-and-answers/draw-graph-apply-single-source-shortest-path-algorithm-dijkstra-source-shortest-path-calcu-q66875035?trackid=xWTPf9A_

subject: design and analysis of algorithm

please read question completely and carefully donot copy answers from internet

do fast

In a given directed weighted graph [positive edge weights), you have applied shortest path algorithm (Dijkstra] and calculated every vertex shortest distance from the given source vertex. You can use question 1 graph and its solution for your understanding that what you have to solve. Question is this, you have to find that if there is a path between u to v vertex in the given graph, can you find this path in minimum possible steps. Also if the path is not there how you will decide this problem also. Your idea, understanding, solution points, different cases and pseudo solution is needed. Vertex Relations A B(2), D(5) B E(1), G(8), F(4) B(1), E(2) D C(10), G(2) E F(2), D(4) F G(1), C(2) G B(3), A(5) In a given directed weighted graph [positive edge weights), you have applied shortest path algorithm (Dijkstra] and calculated every vertex shortest distance from the given source vertex. You can use question 1 graph and its solution for your understanding that what you have to solve. Question is this, you have to find that if there is a path between u to v vertex in the given graph, can you find this path in minimum possible steps. Also if the path is not there how you will decide this problem also. Your idea, understanding, solution points, different cases and pseudo solution is needed. Vertex Relations A B(2), D(5) B E(1), G(8), F(4) B(1), E(2) D C(10), G(2) E F(2), D(4) F G(1), C(2) G B(3), A