data structure for loopuk during Dijkstra More...
#include <estimate_propagator.h>
Public Member Functions | |
| AdjacencyMapEntry () | |
| OptimizableGraph::Vertex * | child () const |
| double | distance () const |
| OptimizableGraph::Edge * | edge () const |
| int | frontierLevel () const |
| const OptimizableGraph::VertexSet & | parent () const |
| void | reset () |
Protected Attributes | |
| OptimizableGraph::Vertex * | _child |
| double | _distance |
| OptimizableGraph::Edge * | _edge |
| int | _frontierLevel |
| OptimizableGraph::VertexSet | _parent |
Private Attributes | |
| bool | inQueue |
| PriorityQueue::iterator | queueIt |
Friends | |
| class | EstimatePropagator |
| class | PriorityQueue |
data structure for loopuk during Dijkstra
Definition at line 107 of file estimate_propagator.h.
| g2o::EstimatePropagator::AdjacencyMapEntry::AdjacencyMapEntry | ( | ) |
Definition at line 51 of file estimate_propagator.cpp.
|
inline |
Definition at line 113 of file estimate_propagator.h.
|
inline |
Definition at line 116 of file estimate_propagator.h.
|
inline |
Definition at line 115 of file estimate_propagator.h.
|
inline |
Definition at line 117 of file estimate_propagator.h.
|
inline |
Definition at line 114 of file estimate_propagator.h.
| void g2o::EstimatePropagator::AdjacencyMapEntry::reset | ( | ) |
Definition at line 56 of file estimate_propagator.cpp.
|
friend |
Definition at line 109 of file estimate_propagator.h.
|
friend |
Definition at line 110 of file estimate_propagator.h.
|
protected |
Definition at line 120 of file estimate_propagator.h.
|
protected |
Definition at line 123 of file estimate_propagator.h.
|
protected |
Definition at line 122 of file estimate_propagator.h.
|
protected |
Definition at line 124 of file estimate_propagator.h.
|
protected |
Definition at line 121 of file estimate_propagator.h.
|
private |
Definition at line 126 of file estimate_propagator.h.
|
private |
Definition at line 127 of file estimate_propagator.h.