#include <topological_roadmap/roadmap.h>
Include dependency graph for shortest_paths.h:
This graph shows which files directly or indirectly include this file:
Go to the source code of this file.
Namespaces | |
| namespace | topological_roadmap |
Typedefs | |
| typedef std::vector< unsigned > | topological_roadmap::EdgeVec |
| typedef std::vector< unsigned > | topological_roadmap::NodeVec |
| typedef std::pair< NodeVec, EdgeVec > | topological_roadmap::Path |
| typedef boost::shared_ptr < SingleSourceShortestPaths > | topological_roadmap::ResultPtr |
Functions | |
| boost::optional< Path > | topological_roadmap::extractPath (ResultPtr res, unsigned dest) |
| Extract path from shortest path query, or null value if there's no path. | |
| 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. | |
Detailed Description
Shortest paths in a roadmap
Definition in file shortest_paths.h.