- compas.topology.astar_shortest_path(network, root, goal)
Find the shortest path between two vertices of a network or mesh using the A* search algorithm.
network (instance of the Network or Mesh class)
root (hashable) – The identifier of the starting node.
goal (hashable) – The identifier of the ending node.
list, None – The path from root to goal, or None, if no path exists between the vertices.