Classes | |
| class | MR |
| class | MR.VertPathInfo |
information associated with each vertex by the paths builder Generated from class MR.VertPathInfo. This is the non-const half of the class. More... | |
| class | MR.EdgePathsBuilderT_MRTrivialMetricToPenalty |
the class is responsible for finding smallest metric edge paths on a mesh Generated from class MR.EdgePathsBuilderT<MR.TrivialMetricToPenalty>. This is the non-const half of the class. More... | |
| class | MR.EdgePathsBuilderT_MRMetricToAStarPenalty |
the class is responsible for finding smallest metric edge paths on a mesh Generated from class MR.EdgePathsBuilderT<MR.MetricToAStarPenalty>. Derived classes: Direct: (non-virtual) MR.EdgePathsAStarBuilder This is the non-const half of the class. More... | |
| class | MR.TrivialMetricToPenalty |
the vertices in the queue are ordered by their metric from a start location Generated from class MR.TrivialMetricToPenalty. This is the non-const half of the class. More... | |
| class | MR.MetricToAStarPenalty |
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... | |
| class | MR.EdgePathsAStarBuilder |
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 non-const half of the class. More... | |