You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
Since dijkstar algorithm can get a node to another node's shortest path and the node to all other nodes' shortest path. But the project only shows the shortest path from node u to node v, the remaining information of the shortest paths from node u to all other nodes can not be retrieved, some usage of this remaining information can be used! Can you add the interface of getting node u to all other nodes' shortest paths? I'm looking for your rely!
The text was updated successfully, but these errors were encountered:
Finding paths to all nodes reachable from a given start node isn't well-tested because I haven't had a need for that functionality myself. In theory, you should be able to repeatedly call extract_shortest_path_from_predecessor_list() with the predecessor map returned from single_source_shortest_paths() and each reachable destination node.
Thinking about it now, I suppose the problem is knowing what all the destination nodes are. It should be possible to extract them from the predecessor map, but that's currently not very convenient. I might look into adding a find_all_paths function if I find some time, but in the meantime I would happily accept a patch that includes tests.
Since dijkstar algorithm can get a node to another node's shortest path and the node to all other nodes' shortest path. But the project only shows the shortest path from node u to node v, the remaining information of the shortest paths from node u to all other nodes can not be retrieved, some usage of this remaining information can be used! Can you add the interface of getting node u to all other nodes' shortest paths? I'm looking for your rely!
The text was updated successfully, but these errors were encountered: