MR.Const_EdgePathsBuilderT_MRMetricToAStarPenalty.Const_ReachedVert Class Reference

information about just reached vertex (with final metric value) Generated from class MR.EdgePathsBuilderT<MR.MetricToAStarPenalty>::ReachedVert. This is the const half of the class. More...

Inheritance diagram for MR.Const_EdgePathsBuilderT_MRMetricToAStarPenalty.Const_ReachedVert:

Classes
struct	_Underlying

Public Member Functions
virtual void	Dispose ()
unsafe	Const_ReachedVert ()
	Constructs an empty (default-constructed) instance.
unsafe	Const_ReachedVert (MR.VertId v, MR.EdgeId backward, float penalty, float metric)
	Constructs MR.EdgePathsBuilderT<MR.MetricToAStarPenalty>::ReachedVert elementwise.
unsafe	Const_ReachedVert (MR.EdgePathsBuilderT_MRMetricToAStarPenalty.Const_ReachedVert _other)
	Generated from constructor MR.EdgePathsBuilderT<MR.MetricToAStarPenalty>::ReachedVert.ReachedVert.

Protected Member Functions
virtual unsafe void	Dispose (bool disposing)

Properties
unsafe ref readonly MR.VertId	v [get]
unsafe ref readonly MR.EdgeId	backward [get]
	edge from this vertex to its predecessor in the forest (if this vertex is not start)
unsafe float	penalty [get]
unsafe float	metric [get]
	summed metric to reach this vertex
Properties inherited from MR.Misc.Object< Const_ReachedVert >
virtual bool	_IsOwning [get]
	Returns true if this is an owning instance, and when disposed, will destroy the underlying C++ instance. If false, we assume that the underlying C++ instance will live long enough.

Additional Inherited Members
Protected Attributes inherited from MR.Misc.Object< Const_ReachedVert >
bool	_IsOwningVal

Detailed Description

information about just reached vertex (with final metric value) Generated from class MR.EdgePathsBuilderT<MR.MetricToAStarPenalty>::ReachedVert. This is the const half of the class.

Property Documentation

penalty

unsafe float MR.Const_EdgePathsBuilderT_MRMetricToAStarPenalty.Const_ReachedVert.penalty

get

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*

---

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

• MREdgePathsBuilder.cs