In a graph, if we know that the shortest path from node A to node G is

Question:

In a graph, if we know that the shortest path from node A to node G is (A → B → E → G), what is the shortest path from node G to node A?

Fantastic news! We've Found the answer you've been seeking!

Step by Step Answer:

Related Book For  book-img-for-question
Question Posted: