data structure for loopuk during Dijkstra
More...
#include <estimate_propagator.h>
data structure for loopuk during Dijkstra
Definition at line 107 of file estimate_propagator.h.
◆ AdjacencyMapEntry()
g2o::EstimatePropagator::AdjacencyMapEntry::AdjacencyMapEntry |
( |
| ) |
|
◆ child()
◆ distance()
double g2o::EstimatePropagator::AdjacencyMapEntry::distance |
( |
| ) |
const |
|
inline |
◆ edge()
◆ frontierLevel()
int g2o::EstimatePropagator::AdjacencyMapEntry::frontierLevel |
( |
| ) |
const |
|
inline |
◆ parent()
◆ reset()
void g2o::EstimatePropagator::AdjacencyMapEntry::reset |
( |
| ) |
|
◆ EstimatePropagator
◆ PriorityQueue
◆ _child
◆ _distance
double g2o::EstimatePropagator::AdjacencyMapEntry::_distance |
|
protected |
◆ _edge
◆ _frontierLevel
int g2o::EstimatePropagator::AdjacencyMapEntry::_frontierLevel |
|
protected |
◆ _parent
◆ inQueue
bool g2o::EstimatePropagator::AdjacencyMapEntry::inQueue |
|
private |
◆ queueIt
PriorityQueue::iterator g2o::EstimatePropagator::AdjacencyMapEntry::queueIt |
|
private |
The documentation for this class was generated from the following files: