AISNavigation::Dijkstra Struct Reference
#include <dijkstra.h>
List of all members.
Classes |
struct | AdjacencyMapEntry |
struct | CostFunction |
struct | TreeAction |
Public Types |
typedef std::map
< Graph::Vertex
*, AdjacencyMapEntry > | AdjacencyMap |
typedef std::map
< Graph::Vertex
*, AdjacencyMapEntry > | AdjacencyMap |
Public Member Functions |
AdjacencyMap & | adjacencyMap () |
AdjacencyMap & | adjacencyMap () |
| Dijkstra (Graph *g) |
| Dijkstra (Graph *g) |
Graph * | graph () |
Graph * | graph () |
void | shortestPaths (Graph::Vertex *v, Dijkstra::CostFunction *cost, double maxDistance=std::numeric_limits< double >::max(), double comparisonConditioner=1e-3, bool directed=false) |
void | shortestPaths (Graph::Vertex *v, Dijkstra::CostFunction *cost, double maxDistance=std::numeric_limits< double >::max(), double comparisonConditioner=1e-3, bool directed=false) |
Graph::VertexSet & | visited () |
Graph::VertexSet & | visited () |
Static Public Member Functions |
static void | computeTree (Graph::Vertex *v, AdjacencyMap &amap) |
static void | computeTree (Graph::Vertex *v, AdjacencyMap &amap) |
static void | visitAdjacencyMap (Graph::Vertex *v, AdjacencyMap &amap, TreeAction *action) |
static void | visitAdjacencyMap (Graph::Vertex *v, AdjacencyMap &amap, TreeAction *action) |
Protected Member Functions |
void | reset () |
void | reset () |
Protected Attributes |
AdjacencyMap | _adjacencyMap |
Graph * | _graph |
Graph::VertexSet | _visited |
Detailed Description
Definition at line 26 of file include/hogman_minimal/graph/dijkstra.h.
Member Typedef Documentation
Constructor & Destructor Documentation
AISNavigation::Dijkstra::Dijkstra |
( |
Graph * |
g |
) |
|
AISNavigation::Dijkstra::Dijkstra |
( |
Graph * |
g |
) |
|
Member Function Documentation
AdjacencyMap& AISNavigation::Dijkstra::adjacencyMap |
( |
|
) |
[inline] |
AdjacencyMap& AISNavigation::Dijkstra::adjacencyMap |
( |
|
) |
[inline] |
Graph* AISNavigation::Dijkstra::graph |
( |
|
) |
[inline] |
Graph* AISNavigation::Dijkstra::graph |
( |
|
) |
[inline] |
void AISNavigation::Dijkstra::reset |
( |
|
) |
[protected] |
void AISNavigation::Dijkstra::reset |
( |
|
) |
[protected] |
void AISNavigation::Dijkstra::shortestPaths |
( |
Graph::Vertex * |
v, |
|
|
Dijkstra::CostFunction * |
cost, |
|
|
double |
maxDistance = std::numeric_limits< double >::max() , |
|
|
double |
comparisonConditioner = 1e-3 , |
|
|
bool |
directed = false | |
|
) |
| | |
void AISNavigation::Dijkstra::shortestPaths |
( |
Graph::Vertex * |
v, |
|
|
Dijkstra::CostFunction * |
cost, |
|
|
double |
maxDistance = std::numeric_limits< double >::max() , |
|
|
double |
comparisonConditioner = 1e-3 , |
|
|
bool |
directed = false | |
|
) |
| | |
Member Data Documentation
The documentation for this struct was generated from the following files: