| 
    MRPT
    1.9.9
    
   | 
 
#include <mrpt/graphs/CDirectedGraph.h>#include <mrpt/graphs/CDirectedTree.h>#include <mrpt/containers/traits_map.h>#include <mrpt/math/utils.h>#include <limits>#include <iostream>#include <vector>#include <utility>#include <exception>#include <functional>

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: 7d5e6d718 Fri Aug 24 01:51:28 2018 +0200 at lun nov 2 08:35:50 CET 2020 |