mrmeshpy.EdgePathsBuilderT_MetricToAStarPenalty.ReachedVert Class Reference

Public Member Functions
None	__init__ (self)
None	__init__ (self, VertId v, Id_EdgeTag backward, float penalty, float metric)
Id_EdgeTag	backward (self)
None	backward (self, Id_EdgeTag arg1)
float	metric (self)
None	metric (self, float arg1)
float	penalty (self)
None	penalty (self, float arg1)

Static Public Member Functions
None	__init__ (*args, **kwargs)
EdgePathsBuilderT_MetricToAStarPenalty.ReachedVert	operator (*args, **kwargs)
EdgePathsBuilderT_MetricToAStarPenalty.ReachedVert	operator (*args, **kwargs)

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__() [1/3]

None mrmeshpy.EdgePathsBuilderT_MetricToAStarPenalty.ReachedVert.__init__ ( * args, ** kwargs )

static

__init__() [2/3]

None mrmeshpy.EdgePathsBuilderT_MetricToAStarPenalty.ReachedVert.__init__

(

self

)

__init__() [3/3]

None mrmeshpy.EdgePathsBuilderT_MetricToAStarPenalty.ReachedVert.__init__	(		self,
		VertId	v,
		Id_EdgeTag	backward,
		float	penalty,
		float	metric )

Implicit aggregate constructor.

Member Function Documentation

backward() [1/2]

Id_EdgeTag mrmeshpy.EdgePathsBuilderT_MetricToAStarPenalty.ReachedVert.backward

(

self

)

edge from this vertex to its predecessor in the forest (if this vertex is not start)

backward() [2/2]

None mrmeshpy.EdgePathsBuilderT_MetricToAStarPenalty.ReachedVert.backward	(		self,
		Id_EdgeTag	arg1 )

metric() [1/2]

float mrmeshpy.EdgePathsBuilderT_MetricToAStarPenalty.ReachedVert.metric

(

self

)

summed metric to reach this vertex

metric() [2/2]

None mrmeshpy.EdgePathsBuilderT_MetricToAStarPenalty.ReachedVert.metric	(		self,
		float	arg1 )

operator() [1/2]

EdgePathsBuilderT_MetricToAStarPenalty.ReachedVert mrmeshpy.EdgePathsBuilderT_MetricToAStarPenalty.ReachedVert.operator ( * args, ** kwargs )

static

operator() [2/2]

EdgePathsBuilderT_MetricToAStarPenalty.ReachedVert mrmeshpy.EdgePathsBuilderT_MetricToAStarPenalty.ReachedVert.operator ( * args, ** kwargs )

static

penalty() [1/2]

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

penalty() [2/2]

None mrmeshpy.EdgePathsBuilderT_MetricToAStarPenalty.ReachedVert.penalty	(		self,
		float	arg1 )

Member Data Documentation

_offsetof_backward

typing mrmeshpy.EdgePathsBuilderT_MetricToAStarPenalty.ReachedVert._offsetof_backward = 4

staticprotected

_offsetof_metric

typing mrmeshpy.EdgePathsBuilderT_MetricToAStarPenalty.ReachedVert._offsetof_metric = 12

staticprotected

_offsetof_penalty

typing mrmeshpy.EdgePathsBuilderT_MetricToAStarPenalty.ReachedVert._offsetof_penalty = 8

staticprotected

_offsetof_v

typing mrmeshpy.EdgePathsBuilderT_MetricToAStarPenalty.ReachedVert._offsetof_v = 0

staticprotected

---

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

• mrmeshpy.pyi