#include "optimizable_graph.h"
#include "sparse_optimizer.h"
#include <map>
#include <set>
#include <limits>
#include <tr1/unordered_map>
Go to the source code of this file.
Classes | |
class | g2o::EstimatePropagator::AdjacencyMapEntry |
data structure for loopuk during Dijkstra More... | |
class | g2o::EstimatePropagator |
propagation of an initial guess More... | |
class | g2o::EstimatePropagatorCost |
cost for traversing along active edges in the optimizer More... | |
class | g2o::EstimatePropagatorCostOdometry |
cost for traversing only odometry edges. More... | |
class | g2o::EstimatePropagator::PriorityQueue |
priority queue for AdjacencyMapEntry More... | |
struct | g2o::EstimatePropagator::PropagateAction |
Applying the action for propagating. More... | |
class | g2o::EstimatePropagator::VertexIDHashFunction |
hash function for a vertex More... | |
Namespaces | |
g2o | |