|
Blender V5.3
|
An implementation of the A* (AStar) algorithm to solve shortest path problem. More...
Go to the source code of this file.
Classes | |
| struct | blender::BLI_AStarGNLink |
| struct | blender::BLI_AStarGNode |
| struct | blender::BLI_AStarSolution |
| struct | blender::BLI_AStarGraph |
Namespaces | |
| namespace | blender |
| BMesh Iterators. | |
Typedefs | |
| using | blender::astar_f_cost |
Functions | |
| void | blender::BLI_astar_node_init (BLI_AStarGraph *as_graph, int node_index, void *custom_data) |
| void | blender::BLI_astar_node_link_add (BLI_AStarGraph *as_graph, int node1_index, int node2_index, float cost, void *custom_data) |
| int | blender::BLI_astar_node_link_other_node (BLI_AStarGNLink *lnk, int idx) |
| void | blender::BLI_astar_solution_init (BLI_AStarGraph *as_graph, BLI_AStarSolution *as_solution, void *custom_data) |
| void | blender::BLI_astar_solution_clear (BLI_AStarSolution *as_solution) |
| void | blender::BLI_astar_solution_free (BLI_AStarSolution *as_solution) |
| void | blender::BLI_astar_graph_init (BLI_AStarGraph *as_graph, int node_num, void *custom_data) |
| void | blender::BLI_astar_graph_free (BLI_AStarGraph *as_graph) |
| bool | blender::BLI_astar_graph_solve (BLI_AStarGraph *as_graph, int node_index_src, int node_index_dst, astar_f_cost f_cost_cb, BLI_AStarSolution *r_solution, int max_steps) |
An implementation of the A* (AStar) algorithm to solve shortest path problem.
Definition in file BLI_astar.hh.