What algorithm does neo4j uses for All pairs shortest path?

[tajava2006]

Hi,
I want to know what algorithm does neo4j uses for All pairs shortest path.

There are generally three algorithms in that problem.

1. Floyd-Warshall Algorithm

2. matrix multiplication

3. Johnson's Algorihtm

Which one does neo4j use?

Thank you

[jggomez]

Hi

https://neo4j.com/docs/graph-data-science/current/alpha-algorithms/all-pairs-shortest-path/

Thanks

[sameerG]

https://neo4j.com/docs/graph-data-science/current/installation/#_supported_neo4j_versions

[tajava2006]

Thanks but, I already checked the manual.

The manual only shows how to use APSP and does not show what algorithms APSP uses.

[Cobra]

Hello @tajava2006

I don't know which algorithm is used but I can tell you where you can find it:

GitHub

neo4j/graph-data-science

Source code for the Neo4j Graph Data Science library of graph algorithms. - neo4j/graph-data-science

This is the GDS Github source code, I'm sure you can look for the method and find the algorithm

Regards,
Cobra

[tajava2006]

@Cobra
I'll give it a try. Thanks.