MR.Const_EdgePathsAStarBuilder Class Reference

the class is responsible for finding shortest edge paths on a mesh in Euclidean metric using A* heuristics Generated from class MR.EdgePathsAStarBuilder. Base classes: Direct: (non-virtual) MR.EdgePathsBuilderT<MR.MetricToAStarPenalty> This is the const half of the class. More...

Inheritance diagram for MR.Const_EdgePathsAStarBuilder:

Classes
struct	_Underlying

Public Member Functions
virtual void	Dispose ()
unsafe	Const_EdgePathsAStarBuilder (MR._ByValue_EdgePathsAStarBuilder _other)
	Generated from constructor MR.EdgePathsAStarBuilder.EdgePathsAStarBuilder.
unsafe	Const_EdgePathsAStarBuilder (MR.Const_Mesh mesh, MR.VertId target, MR.VertId start)
	Generated from constructor MR.EdgePathsAStarBuilder.EdgePathsAStarBuilder.
unsafe	Const_EdgePathsAStarBuilder (MR.Const_Mesh mesh, MR.Const_MeshTriPoint target, MR.Const_MeshTriPoint start)
	Generated from constructor MR.EdgePathsAStarBuilder.EdgePathsAStarBuilder.
unsafe bool	done ()
	returns true if further edge forest growth is impossible Generated from method MR.EdgePathsAStarBuilder.done.
unsafe float	doneDistance ()
	returns path length till the next candidate vertex or maximum float value if all vertices have been reached Generated from method MR.EdgePathsAStarBuilder.doneDistance.
unsafe MR.Phmap.Const_FlatHashMap_MRVertId_MRVertPathInfo	vertPathInfoMap ()
	gives read access to the map from vertex to path to it Generated from method MR.EdgePathsAStarBuilder.vertPathInfoMap.
unsafe MR.? Const_VertPathInfo	getVertInfo (MR.VertId v)
	returns one element from the map (or nullptr if the element is missing) Generated from method MR.EdgePathsAStarBuilder.getVertInfo.
unsafe MR.Std.Vector_MREdgeId	getPathBack (MR.VertId backpathStart)
	returns the path in the forest from given vertex to one of start vertices Generated from method MR.EdgePathsAStarBuilder.getPathBack.
unsafe MR.VertId	trackPathBack (MR.VertId v, MR.Std.Vector_MREdgeId? res=null)
	tracks back path in the forest from the given vertex to one of start vertices, which is returned; optionally appends tracked path (res) Generated from method MR.EdgePathsAStarBuilder.trackPathBack.

Static Public Member Functions
static unsafe implicit	operator MR.Const_EdgePathsBuilderT_MRMetricToAStarPenalty (Const_EdgePathsAStarBuilder self)

Protected Member Functions
virtual unsafe void	Dispose (bool disposing)

Additional Inherited Members
Protected Attributes inherited from MR.Misc.Object< Const_EdgePathsAStarBuilder >
bool	_IsOwningVal
Properties inherited from MR.Misc.Object< Const_EdgePathsAStarBuilder >
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.

Detailed Description

the class is responsible for finding shortest edge paths on a mesh in Euclidean metric using A* heuristics Generated from class MR.EdgePathsAStarBuilder. Base classes: Direct: (non-virtual) MR.EdgePathsBuilderT<MR.MetricToAStarPenalty> This is the const half of the class.

---

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

• MREdgePathsBuilder.cs