graph/path: allow incremental path building for Dijkstra
Created by: kortschak
Please take a look.
BellmanFord is more subtle and I need to think about it some more. There is room for optimisation here, but I think overall this is a win in terms of flexibility and in cases where there are large disconnected graphs, a reduction in overall space.
Updates #486 (closed)