propagation of an initial guess More...
#include <estimate_propagator.h>
Classes | |
| class | AdjacencyMapEntry |
| data structure for loopuk during Dijkstra More... | |
| class | PriorityQueue |
| priority queue for AdjacencyMapEntry More... | |
| struct | PropagateAction |
| Applying the action for propagating. More... | |
| class | PropagateCost |
| cost for traversing along active edges in the optimizer More... | |
| class | VertexIDHashFunction |
| hash function for a vertex More... | |
Public Types | |
| typedef std::tr1::unordered_map < OptimizableGraph::Vertex *, AdjacencyMapEntry, VertexIDHashFunction > | AdjacencyMap |
Public Member Functions | |
| AdjacencyMap & | adjacencyMap () |
| EstimatePropagator (OptimizableGraph *g) | |
| OptimizableGraph * | graph () |
| void | propagate (OptimizableGraph::Vertex *v, const EstimatePropagator::PropagateCost &cost, const EstimatePropagator::PropagateAction &action=PropagateAction(), double maxDistance=std::numeric_limits< double >::max(), double maxEdgeCost=std::numeric_limits< double >::max()) |
| void | propagate (OptimizableGraph::VertexSet &vset, const EstimatePropagator::PropagateCost &cost, const EstimatePropagator::PropagateAction &action=PropagateAction(), double maxDistance=std::numeric_limits< double >::max(), double maxEdgeCost=std::numeric_limits< double >::max()) |
| OptimizableGraph::VertexSet & | visited () |
Protected Member Functions | |
| void | reset () |
Protected Attributes | |
| AdjacencyMap | _adjacencyMap |
| OptimizableGraph * | _graph |
| OptimizableGraph::VertexSet | _visited |
propagation of an initial guess
Definition at line 38 of file estimate_propagator.h.
| typedef std::tr1::unordered_map<OptimizableGraph::Vertex*, AdjacencyMapEntry, VertexIDHashFunction> g2o::EstimatePropagator::AdjacencyMap |
Definition at line 120 of file estimate_propagator.h.
Definition at line 56 of file estimate_propagator.cpp.
| AdjacencyMap& g2o::EstimatePropagator::adjacencyMap | ( | ) | [inline] |
Definition at line 125 of file estimate_propagator.h.
| OptimizableGraph* g2o::EstimatePropagator::graph | ( | ) | [inline] |
Definition at line 126 of file estimate_propagator.h.
| void g2o::EstimatePropagator::propagate | ( | OptimizableGraph::Vertex * | v, |
| const EstimatePropagator::PropagateCost & | cost, | ||
| const EstimatePropagator::PropagateAction & | action = PropagateAction(), |
||
| double | maxDistance = std::numeric_limits<double>::max(), |
||
| double | maxEdgeCost = std::numeric_limits<double>::max() |
||
| ) |
propagate an initial guess starting from v. The function computes a spanning tree whereas the cost for each edge is determined by calling cost() and the action applied to each vertex is action().
Definition at line 76 of file estimate_propagator.cpp.
| void g2o::EstimatePropagator::propagate | ( | OptimizableGraph::VertexSet & | vset, |
| const EstimatePropagator::PropagateCost & | cost, | ||
| const EstimatePropagator::PropagateAction & | action = PropagateAction(), |
||
| double | maxDistance = std::numeric_limits<double>::max(), |
||
| double | maxEdgeCost = std::numeric_limits<double>::max() |
||
| ) |
same as above but starting to propagate from a set of vertices instead of just a single one.
Definition at line 87 of file estimate_propagator.cpp.
| void g2o::EstimatePropagator::reset | ( | ) | [protected] |
Definition at line 65 of file estimate_propagator.cpp.
| OptimizableGraph::VertexSet& g2o::EstimatePropagator::visited | ( | ) | [inline] |
Definition at line 124 of file estimate_propagator.h.
AdjacencyMap g2o::EstimatePropagator::_adjacencyMap [protected] |
Definition at line 151 of file estimate_propagator.h.
OptimizableGraph* g2o::EstimatePropagator::_graph [protected] |
Definition at line 153 of file estimate_propagator.h.
Definition at line 152 of file estimate_propagator.h.