MeshLib Python Docs
Loading...
Searching...
No Matches
mrmeshpy.ConstEdgePathsBuilderT_MetricToAStarPenalty.ReachedVert Class Reference
Inheritance diagram for mrmeshpy.ConstEdgePathsBuilderT_MetricToAStarPenalty.ReachedVert:

Public Member Functions

None __init__ (EdgePathsBuilderT_MetricToAStarPenalty.ReachedVert self)
None __init__ (EdgePathsBuilderT_MetricToAStarPenalty.ReachedVert self, EdgePathsBuilderT_MetricToAStarPenalty.ConstReachedVert arg0)
None __init__ (EdgePathsBuilderT_MetricToAStarPenalty.ReachedVert self, ConstVertId v, ConstEdgeId backward, float penalty, float metric)
EdgePathsBuilderT_MetricToAStarPenalty.ReachedVert assign (EdgePathsBuilderT_MetricToAStarPenalty.ReachedVert self, EdgePathsBuilderT_MetricToAStarPenalty.ConstReachedVert other)
EdgeId backward (self)
None backward (self, ConstEdgeId arg1)
float metric (self)
None metric (self, float arg1)
float penalty (self)
None penalty (self, float arg1)
VertId v (self)
None v (self, ConstVertId arg1)
Public Member Functions inherited from mrmeshpy.EdgePathsBuilderT_MetricToAStarPenalty.ConstReachedVert
 __init__ (self, *args, **kwargs)

Static Public Member Functions

None __init__ (*args, **kwargs)

Additional Inherited Members

Static Protected Attributes inherited from mrmeshpy.EdgePathsBuilderT_MetricToAStarPenalty.ConstReachedVert
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__() [1/4]

None mrmeshpy.ConstEdgePathsBuilderT_MetricToAStarPenalty.ReachedVert.__init__ ( * args,
** kwargs )
static

◆ __init__() [2/4]

None mrmeshpy.ConstEdgePathsBuilderT_MetricToAStarPenalty.ReachedVert.__init__ ( EdgePathsBuilderT_MetricToAStarPenalty.ReachedVert self)

◆ __init__() [3/4]

None mrmeshpy.ConstEdgePathsBuilderT_MetricToAStarPenalty.ReachedVert.__init__ ( EdgePathsBuilderT_MetricToAStarPenalty.ReachedVert self,
EdgePathsBuilderT_MetricToAStarPenalty.ConstReachedVert arg0 )
Implicit copy constructor.

◆ __init__() [4/4]

None mrmeshpy.ConstEdgePathsBuilderT_MetricToAStarPenalty.ReachedVert.__init__ ( EdgePathsBuilderT_MetricToAStarPenalty.ReachedVert self,
ConstVertId v,
ConstEdgeId backward,
float penalty,
float metric )
Implicit aggregate constructor.

Member Function Documentation

◆ assign()

◆ backward() [1/2]

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

Reimplemented from mrmeshpy.EdgePathsBuilderT_MetricToAStarPenalty.ConstReachedVert.

◆ backward() [2/2]

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

Reimplemented from mrmeshpy.EdgePathsBuilderT_MetricToAStarPenalty.ConstReachedVert.

◆ metric() [1/2]

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

Reimplemented from mrmeshpy.EdgePathsBuilderT_MetricToAStarPenalty.ConstReachedVert.

◆ metric() [2/2]

None mrmeshpy.ConstEdgePathsBuilderT_MetricToAStarPenalty.ReachedVert.metric ( self,
float arg1 )
summed metric to reach this vertex

Reimplemented from mrmeshpy.EdgePathsBuilderT_MetricToAStarPenalty.ConstReachedVert.

◆ penalty() [1/2]

float mrmeshpy.ConstEdgePathsBuilderT_MetricToAStarPenalty.ReachedVert.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*

Reimplemented from mrmeshpy.EdgePathsBuilderT_MetricToAStarPenalty.ConstReachedVert.

◆ penalty() [2/2]

None mrmeshpy.ConstEdgePathsBuilderT_MetricToAStarPenalty.ReachedVert.penalty ( self,
float arg1 )
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*

Reimplemented from mrmeshpy.EdgePathsBuilderT_MetricToAStarPenalty.ConstReachedVert.

◆ v() [1/2]

VertId mrmeshpy.ConstEdgePathsBuilderT_MetricToAStarPenalty.ReachedVert.v ( self)

◆ v() [2/2]

None mrmeshpy.ConstEdgePathsBuilderT_MetricToAStarPenalty.ReachedVert.v ( self,
ConstVertId arg1 )

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