PGROUTING
3.2

#include <limits>
#include <algorithm>
#include <vector>
#include "contraction/pgr_contractionGraph.hpp"
#include "cpp_common/pgr_base_graph.hpp"
#include "cpp_common/ch_vertex.h"
#include "cpp_common/ch_edge.h"
Go to the source code of this file.
Namespaces  
pgrouting  
Book keeping class for swapping orders between vehicles.  
pgrouting::graph  
boost::graph simplified to pgRouting needs This class gives the handling basics of a boost::graph of kind G where G: can be an undirected graph or a directed graph.  
Typedefs  
using  pgrouting::graph::CHDirectedGraph = Pgr_contractionGraph< boost::adjacency_list< boost::listS, boost::vecS, boost::bidirectionalS, CH_vertex, CH_edge > > 
using  pgrouting::graph::CHUndirectedGraph = Pgr_contractionGraph< boost::adjacency_list< boost::listS, boost::vecS, boost::undirectedS, CH_vertex, CH_edge > > 