This lets you use vg::algorithms::dijkstra() to do a pruned search: instead of stopping when you return false for a node, it will instead just stop exploring from that node, and keep exploring from other nodes.
It also lets you skip the initial visit(s) to the starting node(s), so they can be visited later with shortest paths to them from themselves or other start nodes.
This lets you use
vg::algorithms::dijkstra()to do a pruned search: instead of stopping when you return false for a node, it will instead just stop exploring from that node, and keep exploring from other nodes.It also lets you skip the initial visit(s) to the starting node(s), so they can be visited later with shortest paths to them from themselves or other start nodes.