|
| None | __init__ (self, ConstMesh mesh, ConstVertId target, ConstVertId start) |
| None | __init__ (self, ConstMesh mesh, ConstMeshTriPoint target, ConstMeshTriPoint start) |
| None | __init__ (self, ConstEdgePathsAStarBuilder arg0) |
| | __init__ (self, *args, **kwargs) |
| | __init__ (self, *args, **kwargs) |
| bool | done (self) |
| float | doneDistance (self) |
| std_vector_Id_EdgeTag | getPathBack (self, ConstVertId backpathStart) |
| ConstVertPathInfo | getVertInfo (self, ConstVertId v) |
| VertId | trackPathBack (self, ConstVertId v, std_vector_Id_EdgeTag res=None) |
| Const_phmap_flat_hash_map_Id_VertTag_VertPathInfo_phmap_Hash_Id_VertTag_phmap_EqualTo_Id_VertTag_Allocator_std_pair_Id_VertTag_const_VertPathInfo | vertPathInfoMap (self) |
| None | __init__ (self, ConstMeshTopology topology, Const_func_float_from_Id_EdgeTag metric) |
| None | __init__ (self, ConstMeshTopology topology) |
| None | __init__ (self, ConstEdgePathsBuilderT_MetricToAStarPenalty arg0) |
| bool | addOrgRingSteps (self, EdgePathsBuilderT_MetricToAStarPenalty.ConstReachedVert rv) |
| bool | addStart (self, ConstVertId startVert, float startMetric) |
| EdgePathsBuilderT_MetricToAStarPenalty.ReachedVert | growOneEdge (self) |
| EdgePathsBuilderT_MetricToAStarPenalty.ReachedVert | reachNext (self) |
| None | reset (self, Const_func_float_from_Id_EdgeTag metric) |
Generated from: MR::EdgePathsAStarBuilder
the class is responsible for finding shortest edge paths on a mesh in Euclidean metric
using A* heuristics