the vertices in the queue are ordered by the sum of their metric from a start location and the lower bound of a path till target point (A* heuristic) Generated from class MR.MetricToAStarPenalty. This is the non-const half of the class.
More...
the vertices in the queue are ordered by the sum of their metric from a start location and the lower bound of a path till target point (A* heuristic) Generated from class MR.MetricToAStarPenalty. This is the non-const half of the class.
◆ MetricToAStarPenalty() [1/4]
| unsafe MR.MetricToAStarPenalty.MetricToAStarPenalty |
( |
| ) |
|
|
inline |
Constructs an empty (default-constructed) instance.
◆ MetricToAStarPenalty() [2/4]
| unsafe MR.MetricToAStarPenalty.MetricToAStarPenalty |
( |
MR.Const_VertCoords? | points, |
|
|
MR.Vector3f | target ) |
|
inline |
◆ MetricToAStarPenalty() [3/4]
| unsafe MR.MetricToAStarPenalty.MetricToAStarPenalty |
( |
MR.Const_MetricToAStarPenalty | _other | ) |
|
|
inline |
Generated from constructor MR.MetricToAStarPenalty.MetricToAStarPenalty.
◆ MetricToAStarPenalty() [4/4]
Generated from constructor MR.MetricToAStarPenalty.MetricToAStarPenalty.
◆ assign()
Generated from method MR.MetricToAStarPenalty.operator=.
◆ points
| new unsafe MR.? Const_VertCoords MR.MetricToAStarPenalty.points |
|
getset |
◆ target
| new unsafe ref MR.Vector3f MR.MetricToAStarPenalty.target |
|
get |
The documentation for this class was generated from the following file: