#include <map>
#include <string>
#include <utility>
#include <vector>
#include <set>
#include <limits>
#include "max_flow/pgr_costFlowGraph.hpp"
#include <boost/graph/successive_shortest_path_nonnegative_weights.hpp>
#include <boost/graph/find_flow_cost.hpp>
#include "c_types/pgr_flow_t.h"
#include "c_types/pgr_costFlow_t.h"
Go to the source code of this file.

 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.

