Classes | |
| class | ConstReachedVert |
| class | ReachedVert |
Public Member Functions | |
| __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) |
Generated from: MR::EdgePathsBuilderT<MR::MetricToAStarPenalty> the class is responsible for finding smallest metric edge paths on a mesh
| mrmeshpy.ConstEdgePathsBuilderT_MetricToAStarPenalty.__init__ | ( | self, | |
| * | args, | ||
| ** | kwargs ) |
__init__(*args, **kwargs) Overloaded function. 1. __init__(self: meshlib.mrmeshpy.ConstEdgePathsBuilderT_MetricToAStarPenalty, topology: meshlib.mrmeshpy.ConstMeshTopology, metric: meshlib.mrmeshpy.Const_func_float_from_Id_EdgeTag) -> None 2. __init__(self: meshlib.mrmeshpy.ConstEdgePathsBuilderT_MetricToAStarPenalty, topology: meshlib.mrmeshpy.ConstMeshTopology) -> None 3. __init__(self: meshlib.mrmeshpy.ConstEdgePathsBuilderT_MetricToAStarPenalty, arg0: meshlib.mrmeshpy.ConstEdgePathsBuilderT_MetricToAStarPenalty) -> None Implicit copy constructor. 4. __init__(self: meshlib.mrmeshpy.ConstEdgePathsBuilderT_MetricToAStarPenalty, : meshlib.mrmeshpy.ConstEdgePathsBuilderT_MetricToAStarPenalty) -> None
| bool mrmeshpy.ConstEdgePathsBuilderT_MetricToAStarPenalty.done | ( | self | ) |
returns true if further edge forest growth is impossible
| float mrmeshpy.ConstEdgePathsBuilderT_MetricToAStarPenalty.doneDistance | ( | self | ) |
returns path length till the next candidate vertex or maximum float value if all vertices have been reached
| std_vector_Id_EdgeTag mrmeshpy.ConstEdgePathsBuilderT_MetricToAStarPenalty.getPathBack | ( | self, | |
| ConstVertId | backpathStart ) |
returns the path in the forest from given vertex to one of start vertices
| ConstVertPathInfo mrmeshpy.ConstEdgePathsBuilderT_MetricToAStarPenalty.getVertInfo | ( | self, | |
| ConstVertId | v ) |
returns one element from the map (or nullptr if the element is missing)
| VertId mrmeshpy.ConstEdgePathsBuilderT_MetricToAStarPenalty.trackPathBack | ( | self, | |
| ConstVertId | v, | ||
| std_vector_Id_EdgeTag | res = None ) |
tracks back path in the forest from the given vertex to one of start vertices, which is returned; optionally appends tracked path (res)
| Const_phmap_flat_hash_map_Id_VertTag_VertPathInfo_phmap_Hash_Id_VertTag_phmap_EqualTo_Id_VertTag_Allocator_std_pair_Id_VertTag_const_VertPathInfo mrmeshpy.ConstEdgePathsBuilderT_MetricToAStarPenalty.vertPathInfoMap | ( | self | ) |
gives read access to the map from vertex to path to it