#include "MREdgePaths.h"#include "MRBitSet.h"#include "MRMesh.h"#include "MRRingIterator.h"#include "MRphmap.h"#include "MRMacros.h"#include <queue>Go to the source code of this file.
Classes | |
| struct | MR::VertPathInfo |
| information associated with each vertex by the paths builder More... | |
| class | MR::EdgePathsBuilderT< MetricToPenalty > |
| the class is responsible for finding smallest metric edge paths on a mesh More... | |
| struct | MR::EdgePathsBuilderT< MetricToPenalty >::ReachedVert |
| information about just reached vertex (with final metric value) More... | |
| struct | MR::TrivialMetricToPenalty |
| the vertices in the queue are ordered by their metric from a start location More... | |
| struct | MR::MetricToAStarPenalty |
| class | MR::EdgePathsAStarBuilder |
Namespaces | |
| namespace | MR |
Typedefs | |
| using | MR::VertPathInfoMap = HashMap<VertId, VertPathInfo> |
| using | MR::EdgePathsBuilder = EdgePathsBuilderT<TrivialMetricToPenalty> |