This chapter provides explanations and examples for each of the experimental path finding algorithms in the Neo4j Graph Algorithms library.

The following path finding algorithms help find the shortest path or evaluate the availability and quality of routes:

- Minimum Weight Spanning Tree (
`algo.spanningTree`

) - Shortest Path (
`algo.shortestPath`

) - Single Source Shortest Path (
`algo.shortestPath.deltaStepping`

) - All Pairs Shortest Path (
`algo.allShortestPaths`

) - A* (
`algo.shortestPath.astar`

) - Yen’s K-shortest paths (
`algo.kShortestPaths`

) - Random Walk (
`algo.randomWalk`

)

As of the 3.4.7.0 release, all the Shortest Path procedures assume that they are being executed on undirected graphs. Therefore, the direction of a relationship can be ignored. If you are running these algorithms on a graph where the direction is important, you can use the |