search

neo4j / graph-data-science

Source code for the Neo4j Graph Data Science library of graph algorithms.
https://neo4j.com/docs/graph-data-science/current/
Other
637 stars 161 forks source link

all pairs shortest paths #52

Closed Assiam closed 4 years ago

Assiam commented 4 years ago

Hello,

I suggest to return paths in all pair shortest path algorithm like apoc dijkstra.

Thank you

AliciaFrame commented 4 years ago

I think this has been addressed on the community forum: https://community.neo4j.com/t/shortest-paths-algorithms/19733/7

For now, you can use Yen's K shortest paths with k=1, but we've added a feature request to our roadmap to have our other pathfinding algorithms return paths as well.