| 
    MRPT
    1.9.9
    
   | 
 
#include <mrpt/containers/traits_map.h>#include <mrpt/graphs/CDirectedGraph.h>#include <mrpt/graphs/CDirectedTree.h>#include <mrpt/math/utils.h>#include <exception>#include <functional>#include <iostream>#include <limits>#include <utility>#include <vector>Go to the source code of this file.
Classes | |
| class | mrpt::graphs::detail::NotConnectedGraph | 
| Custom exception class that passes information in case an unconnected graph is passed to a Dijkstra instance.  More... | |
| class | mrpt::graphs::CDijkstra< TYPE_GRAPH, MAPS_IMPLEMENTATION > | 
| The Dijkstra algorithm for finding the shortest path between a given source node in a (weighted) directed graph and all other nodes in the form of a tree.  More... | |
| struct | mrpt::graphs::CDijkstra< TYPE_GRAPH, MAPS_IMPLEMENTATION >::TDistance | 
| Auxiliary struct for topological distances from root node.  More... | |
| struct | mrpt::graphs::CDijkstra< TYPE_GRAPH, MAPS_IMPLEMENTATION >::TPrevious | 
| Auxiliary struct for backward paths.  More... | |
Namespaces | |
| mrpt::graphs | |
| Abstract graph and tree data structures, plus generic graph algorithms.  | |
| mrpt::graphs::detail | |
| Internal functions for MRPT.  | |
| Page generated by Doxygen 1.8.14 for MRPT 1.9.9 Git: 8fe78517f Sun Jul 14 19:43:28 2019 +0200 at lun oct 28 02:10:00 CET 2019 |