title: Dijktra's-How to keep track of nodes in the shortest path from source to the target
body: <p>Yesterday I studied Dijktra's algorithm to find the shortest path.I tried few problems on it so that I can have some command over it.But I faced this question <strong>in which it is asked to find the nodes in the shortest path from source to target if their is path from source to target else print "Impossible"</strong>.Even after thinking a lot I could not manage to solve this problem.Can anybody help ?</p>