PGROUTING
3.2

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. More...
Classes  
class  Pgr_base_graph 
class  Pgr_contractionGraph 
class  Pgr_lineGraph 
class  Pgr_lineGraphFull 
class  PgrCostFlowGraph 
class  PgrDirectedChPPGraph 
class  PgrFlowGraph 
Typedefs  
using  CHDirectedGraph = Pgr_contractionGraph< boost::adjacency_list< boost::listS, boost::vecS, boost::bidirectionalS, CH_vertex, CH_edge > > 
using  CHUndirectedGraph = Pgr_contractionGraph< boost::adjacency_list< boost::listS, boost::vecS, boost::undirectedS, CH_vertex, CH_edge > > 
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.
Current Available vertex classes:
Current Available edge classes:
Data obtained from postgresql is stored in A C array of pgr_edge_t type.
Data obtained from postgresql is stored in o a vector container.
The code is prepared to be used for:
For this example we will use:
Graph initialization is for seting the Vertices of the graph. TODO discuss if also the edges Vector of unique vertices of the graph
There are several ways to initialize the graph
After initializing the graph with the vertices, the edges can be added.
using pgrouting::graph::CHDirectedGraph = typedef Pgr_contractionGraph< boost::adjacency_list < boost::listS, boost::vecS, boost::bidirectionalS, CH_vertex, CH_edge> > 
Definition at line 56 of file ch_graphs.hpp.
using pgrouting::graph::CHUndirectedGraph = typedef Pgr_contractionGraph < boost::adjacency_list < boost::listS, boost::vecS, boost::undirectedS, CH_vertex, CH_edge> > 
Definition at line 51 of file ch_graphs.hpp.