Could we have a documentation for AbstractPathState ? Currently, the total information in the doc about this type is almost zero, or at least I could not easily find it.
For instance it could be nice to have a worked example explaining how to use, e.g. the result of D=dijkstra_shortest_path(g) to effectively extract the shortest path between two vertices directly from D.
https://github.com/JuliaGraphs/Graphs.jl/blob/1a7594a448b0c8fe9251ac7e88fd1b5ab0989e87/src/core.jl#L1-L5
Could we have a documentation for
AbstractPathState
? Currently, the total information in the doc about this type is almost zero, or at least I could not easily find it.For instance it could be nice to have a worked example explaining how to use, e.g. the result of
D=dijkstra_shortest_path(g)
to effectively extract the shortest path between two vertices directly fromD
.