The A* algorithm is accessible through the gds.alpha.shortestPath.astar procedure. The signature follows the same pattern as the other algorithms: the first parameter is the name of the projected graph the algorithm will use, while the second parameter is a map specific to each algorithm. In the A* algorithm configuration, we will find the same startNode, endNode, and relationshipWeightProperty we have already used for the shortestPath procedure. On top of that, two new properties are added to specify the name of the node property holding the latitude and longitude: propertyKeyLat and propertyKeyLon. Here is an example call to the A* algorithm on a projected graph:
MATCH (A:Node {name: "A"})
MATCH (B:Node {name: "B"})
CALL gds.alpha.shortestPath.astar.stream("graph", {
startNode: A,
endNode: B,
relationshipWeightProperty: "weight",
propertyKeyLat: "latitude",
propertyKeyLon...