astar_shortest_path

compas.topology.astar_shortest_path(graph, root, goal)[source]

Find the shortest path between two vertices of a graph or mesh using the A* search algorithm.

Parameters

  • graph (Network | Mesh) – A network or mesh data structure.

  • root (hashable) – The identifier of the starting node.

  • goal (hashable) – The identifier of the ending node.

Returns

list[hashable] | None – The path from root to goal, or None, if no path exists between the vertices.

References

https://en.wikipedia.org/wiki/A*_search_algorithm