$search
#include <dijkstra.h>
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 |
Definition at line 26 of file include/hogman_minimal/graph/dijkstra.h.
| typedef std::map<Graph::Vertex*, AdjacencyMapEntry> AISNavigation::Dijkstra::AdjacencyMap |
Definition at line 56 of file src/graph/dijkstra.h.
| typedef std::map<Graph::Vertex*, AdjacencyMapEntry> AISNavigation::Dijkstra::AdjacencyMap |
Definition at line 53 of file include/hogman_minimal/graph/dijkstra.h.
| AISNavigation::Dijkstra::Dijkstra | ( | Graph * | g | ) |
Definition at line 36 of file dijkstra.cpp.
| AISNavigation::Dijkstra::Dijkstra | ( | Graph * | g | ) |
| AdjacencyMap& AISNavigation::Dijkstra::adjacencyMap | ( | ) | [inline] |
Definition at line 59 of file src/graph/dijkstra.h.
| AdjacencyMap& AISNavigation::Dijkstra::adjacencyMap | ( | ) | [inline] |
Definition at line 56 of file include/hogman_minimal/graph/dijkstra.h.
| static void AISNavigation::Dijkstra::computeTree | ( | Graph::Vertex * | v, | |
| AdjacencyMap & | amap | |||
| ) | [static] |
| static void AISNavigation::Dijkstra::computeTree | ( | Graph::Vertex * | v, | |
| AdjacencyMap & | amap | |||
| ) | [static] |
| Graph* AISNavigation::Dijkstra::graph | ( | ) | [inline] |
Definition at line 60 of file src/graph/dijkstra.h.
| Graph* AISNavigation::Dijkstra::graph | ( | ) | [inline] |
Definition at line 57 of file include/hogman_minimal/graph/dijkstra.h.
| void AISNavigation::Dijkstra::reset | ( | ) | [protected] |
| void AISNavigation::Dijkstra::reset | ( | ) | [protected] |
Definition at line 43 of file dijkstra.cpp.
| 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 | |||
| ) |
Definition at line 58 of file dijkstra.cpp.
| static void AISNavigation::Dijkstra::visitAdjacencyMap | ( | Graph::Vertex * | v, | |
| AdjacencyMap & | amap, | |||
| TreeAction * | action | |||
| ) | [static] |
| void AISNavigation::Dijkstra::visitAdjacencyMap | ( | Graph::Vertex * | v, | |
| AdjacencyMap & | amap, | |||
| TreeAction * | action | |||
| ) | [static] |
Definition at line 132 of file dijkstra.cpp.
| Graph::VertexSet& AISNavigation::Dijkstra::visited | ( | ) | [inline] |
Definition at line 58 of file src/graph/dijkstra.h.
| Graph::VertexSet& AISNavigation::Dijkstra::visited | ( | ) | [inline] |
Definition at line 55 of file include/hogman_minimal/graph/dijkstra.h.
AdjacencyMap AISNavigation::Dijkstra::_adjacencyMap [protected] |
Definition at line 70 of file include/hogman_minimal/graph/dijkstra.h.
Graph * AISNavigation::Dijkstra::_graph [protected] |
Definition at line 72 of file include/hogman_minimal/graph/dijkstra.h.
Graph::VertexSet AISNavigation::Dijkstra::_visited [protected] |
Definition at line 71 of file include/hogman_minimal/graph/dijkstra.h.