|
| None | __init__ (self, Mesh mesh, VertId target, VertId start) |
| None | __init__ (self, Mesh mesh, MeshTriPoint target, MeshTriPoint start) |
| None | __init__ (self, EdgePathsAStarBuilder arg0) |
| None | __init__ (self, MeshTopology topology, func_float_from_Id_EdgeTag metric) |
| None | __init__ (self, MeshTopology topology) |
| None | __init__ (self, EdgePathsBuilderT_MetricToAStarPenalty arg0) |
| bool | addOrgRingSteps (self, EdgePathsBuilderT_MetricToAStarPenalty.ReachedVert rv) |
| bool | addStart (self, VertId startVert, float startMetric) |
| bool | done (self) |
| float | doneDistance (self) |
| std_vector_Id_EdgeTag | getPathBack (self, VertId backpathStart) |
| VertPathInfo | getVertInfo (self, VertId v) |
| EdgePathsBuilderT_MetricToAStarPenalty.ReachedVert | growOneEdge (self) |
| EdgePathsBuilderT_MetricToAStarPenalty.ReachedVert | reachNext (self) |
| None | reset (self, func_float_from_Id_EdgeTag metric) |
| VertId | trackPathBack (self, VertId v, std_vector_Id_EdgeTag res=None) |
| phmap_flat_hash_map_Id_VertTag_VertPathInfo | vertPathInfoMap (self) |
Generated from: MR::EdgePathsAStarBuilder
the class is responsible for finding shortest edge paths on a mesh in Euclidean metric
using A* heuristics