Assume the shortest path in a graph from node A to node H is A B

Question:

Assume the shortest path in a graph from node A to node H is A → B → H.
Also assume that the shortest path from node H to node N is H → G → N.
What is the shortest path from node A to node N?

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

Step by Step Answer:

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