#include <boost/graph/iteration_macros.hpp>
#include <boost/config.hpp>
#include <boost/graph/adjacency_list.hpp>
#include <boost/graph/graph_utility.hpp>
#include <deque>
#include <vector>
#include <set>
#include <map>
#include <limits>
#include "c_types/graph_enum.h"
#include "cpp_common/basic_vertex.h"
#include "cpp_common/xy_vertex.h"
#include "cpp_common/basic_edge.h"
#include "cpp_common/pgr_assert.h"

Include dependency graph for pgr_base_graph.hpp:

This graph shows which files directly or indirectly include this file:

Go to the source code of this file.

Classes
class	pgrouting::graph::Pgr_base_graph< G, T_V, T_E >

class	pgrouting::graph::Pgr_base_graph< G, T_V, T_E >

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

Graph types

Type	pgRouting
UndirectedGraph	Basic undirected graph
DirectedGraph	Basic directed graph
xyUndirectedGraph	X & Y values stored on the vertex
xyDirectedGraph	X & Y values stored on the vertex

typedef graph::Pgr_base_graph< boost::adjacency_list< boost::vecS, boost::vecS, boost::bidirectionalS, Basic_vertex, Basic_edge >, Basic_vertex, Basic_edge > pgrouting::DirectedGraph

typedef graph::Pgr_base_graph< boost::adjacency_list< boost::vecS, boost::vecS, boost::undirectedS, Basic_vertex, Basic_edge >, Basic_vertex, Basic_edge > pgrouting::UndirectedGraph

typedef graph::Pgr_base_graph< boost::adjacency_list< boost::listS, boost::vecS, boost::bidirectionalS, XY_vertex, Basic_edge >, XY_vertex, Basic_edge > pgrouting::xyDirectedGraph

typedef graph::Pgr_base_graph< boost::adjacency_list< boost::listS, boost::vecS, boost::undirectedS, XY_vertex, Basic_edge >, XY_vertex, Basic_edge > pgrouting::xyUndirectedGraph