MeshLib Python Docs
Loading...
Searching...
No Matches
mrmeshpy.ConstEdgePathsBuilderT_MetricToAStarPenalty.ConstReachedVert Class Reference

Public Member Functions

 __init__ (self, *args, **kwargs)
ConstEdgeId backward (self)
float metric (self)
float penalty (self)
ConstVertId v (self)

Static Protected Attributes

typing _offsetof_backward = 4
typing _offsetof_metric = 12
typing _offsetof_penalty = 8
typing _offsetof_v = 0

Detailed Description

Generated from:  MR::EdgePathsBuilderT<MR::MetricToAStarPenalty>::ReachedVert

information about just reached vertex (with final metric value)

Constructor & Destructor Documentation

◆ __init__()

mrmeshpy.ConstEdgePathsBuilderT_MetricToAStarPenalty.ConstReachedVert.__init__ ( self,
* args,
** kwargs )
__init__(*args, **kwargs)
Overloaded function.

1. __init__(self: meshlib.mrmeshpy.EdgePathsBuilderT_MetricToAStarPenalty.ConstReachedVert) -> None

2. __init__(self: meshlib.mrmeshpy.EdgePathsBuilderT_MetricToAStarPenalty.ConstReachedVert, arg0: meshlib.mrmeshpy.EdgePathsBuilderT_MetricToAStarPenalty.ConstReachedVert) -> None

Implicit copy constructor.

3. __init__(self: meshlib.mrmeshpy.EdgePathsBuilderT_MetricToAStarPenalty.ConstReachedVert, v: meshlib.mrmeshpy.ConstVertId, backward: meshlib.mrmeshpy.ConstEdgeId, penalty: float, metric: float) -> None

Implicit aggregate constructor.

4. __init__(self: meshlib.mrmeshpy.EdgePathsBuilderT_MetricToAStarPenalty.ConstReachedVert, : meshlib.mrmeshpy.EdgePathsBuilderT_MetricToAStarPenalty.ConstReachedVert) -> None

Member Function Documentation

◆ backward()

ConstEdgeId mrmeshpy.ConstEdgePathsBuilderT_MetricToAStarPenalty.ConstReachedVert.backward ( self)
edge from this vertex to its predecessor in the forest (if this vertex is not start)

◆ metric()

float mrmeshpy.ConstEdgePathsBuilderT_MetricToAStarPenalty.ConstReachedVert.metric ( self)
summed metric to reach this vertex

◆ penalty()

float mrmeshpy.ConstEdgePathsBuilderT_MetricToAStarPenalty.ConstReachedVert.penalty ( self)
not reached vertices are ordered in priority queue by their penalty (with the smallest value on top);
penalty is equal to metric in ordinary Dijkstra, or equal to (metric + target distance lower bound) in A*

◆ v()

ConstVertId mrmeshpy.ConstEdgePathsBuilderT_MetricToAStarPenalty.ConstReachedVert.v ( self)

Member Data Documentation

◆ _offsetof_backward

typing mrmeshpy.ConstEdgePathsBuilderT_MetricToAStarPenalty.ConstReachedVert._offsetof_backward = 4
staticprotected

◆ _offsetof_metric

typing mrmeshpy.ConstEdgePathsBuilderT_MetricToAStarPenalty.ConstReachedVert._offsetof_metric = 12
staticprotected

◆ _offsetof_penalty

typing mrmeshpy.ConstEdgePathsBuilderT_MetricToAStarPenalty.ConstReachedVert._offsetof_penalty = 8
staticprotected

◆ _offsetof_v

typing mrmeshpy.ConstEdgePathsBuilderT_MetricToAStarPenalty.ConstReachedVert._offsetof_v = 0
staticprotected

The documentation for this class was generated from the following file: