apoc.algo.aStar(startNode NODE, endNode NODE, relTypesAndDirections STRING, weightPropertyName STRING, latPropertyName STRING, lonPropertyName STRING) - runs the A* search algorithm to find the optimal path between two NODE values, using the given RELATIONSHIP property name for the cost function.
apoc.algo.aStarConfig(startNode NODE, endNode NODE, relTypesAndDirections STRING, config MAP<STRING, ANY>) - runs the A* search algorithm to find the optimal path between two NODE values, using the given RELATIONSHIP property name for the cost function.
This procedure looks for weight, latitude and longitude properties in the config.
apoc.algo.allSimplePaths(startNode NODE, endNode NODE, relTypesAndDirections STRING, maxNodes INTEGER) - runs a search algorithm to find all of the simple paths between the given RELATIONSHIP values, up to a max depth described by maxNodes.
The returned paths will not contain loops.
apoc.algo.dijkstra(startNode NODE, endNode NODE, relTypesAndDirections STRING, weightPropertyName STRING, defaultWeight FLOAT, numberOfWantedPaths INTEGER) - runs Dijkstra’s algorithm using the given RELATIONSHIP property as the cost function.