astar_shortest_path

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

Find the shortest path between two vertices of a network using the A* search algorithm.

Parameters

  • network (instance of the Network class)

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

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

Returns

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

Examples

>>>

References

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