g2o
|
#include <hyper_dijkstra.h>
Public Member Functions | |
AdjacencyMapEntry (HyperGraph::Vertex *_child=0, HyperGraph::Vertex *_parent=0, HyperGraph::Edge *_edge=0, double _distance=std::numeric_limits< double >::max()) | |
HyperGraph::Vertex * | child () const |
HyperGraph::Vertex * | parent () const |
HyperGraph::Edge * | edge () const |
double | distance () const |
HyperGraph::VertexSet & | children () |
const HyperGraph::VertexSet & | children () const |
Protected Attributes | |
HyperGraph::Vertex * | _child |
HyperGraph::Vertex * | _parent |
HyperGraph::Edge * | _edge |
double | _distance |
HyperGraph::VertexSet | _children |
Friends | |
struct | HyperDijkstra |
Definition at line 50 of file hyper_dijkstra.h.
g2o::HyperDijkstra::AdjacencyMapEntry::AdjacencyMapEntry | ( | HyperGraph::Vertex * | _child = 0 , |
HyperGraph::Vertex * | _parent = 0 , |
||
HyperGraph::Edge * | _edge = 0 , |
||
double | _distance = std::numeric_limits<double>::max() |
||
) |
Definition at line 52 of file hyper_dijkstra.cpp.
|
inline |
Definition at line 56 of file hyper_dijkstra.h.
Referenced by g2o::HyperDijkstra::computeTree(), g2o::HyperDijkstra::HyperDijkstra(), and g2o::HyperDijkstra::shortestPaths().
|
inline |
Definition at line 60 of file hyper_dijkstra.h.
|
inline |
Definition at line 61 of file hyper_dijkstra.h.
|
inline |
|
inline |
Definition at line 58 of file hyper_dijkstra.h.
|
inline |
Definition at line 57 of file hyper_dijkstra.h.
Referenced by g2o::HyperDijkstra::computeTree(), and g2o::HyperDijkstra::visitAdjacencyMap().
|
friend |
Definition at line 51 of file hyper_dijkstra.h.
|
protected |
Definition at line 63 of file hyper_dijkstra.h.
|
protected |
Definition at line 67 of file hyper_dijkstra.h.
Referenced by g2o::HyperDijkstra::computeTree().
|
protected |
Definition at line 66 of file hyper_dijkstra.h.
|
protected |
Definition at line 65 of file hyper_dijkstra.h.
|
protected |
Definition at line 64 of file hyper_dijkstra.h.