#include <topological_roadmap/shortest_paths.h>#include <boost/property_map/property_map.hpp>#include <boost/graph/dijkstra_shortest_paths.hpp>#include <boost/make_shared.hpp>#include <boost/foreach.hpp>#include <ros/ros.h>#include <list>
Go to the source code of this file.
Classes | |
| struct | topological_roadmap::SingleSourceShortestPaths |
Namespaces | |
| namespace | topological_roadmap |
Typedefs | |
| typedef pair< DistanceMap, PredMap > | topological_roadmap::DijkstraResult |
| typedef map< GraphVertex, double > | topological_roadmap::DistanceMap |
| typedef map< GraphVertex, GraphVertex > | topological_roadmap::PredMap |
Functions | |
| DijkstraResult | topological_roadmap::dijkstra (const Roadmap &r, const unsigned src) |
| boost::optional< Path > | topological_roadmap::extractPath (ResultPtr res, unsigned dest) |
| Extract path from shortest path query, or null value if there's no path. | |
| optional< Path > | topological_roadmap::extractPath (DijkstraResult &res, const unsigned src, const unsigned dest, const Roadmap &r) |
| ResultPtr | topological_roadmap::shortestPaths (const Roadmap &r, unsigned src) |
| Return object that can be used for shortest path queries Note the code scales with the largest node id in the graph, and assumes all edge costs are positive. | |
Implementation of shortest_paths.h
Definition in file shortest_paths.cpp.