First page
Back
Continue Last page
Graphics
Path Recovery
So what's the shortest path from node 0 to node 1?
To get to node 1 you come from 2
To get to node 2 you come from 4
To get to node 4 your come from 0. = “0, 4, 2, 1” (backwards)