pgRouting
pgRouting extends the PostGIS / PostgreSQL geospatial database to provide geospatial routing functionality.
 All Classes Namespaces Files Functions Variables Typedefs Enumerations Enumerator Friends Macros Pages
Public Types | Public Member Functions | Public Attributes | List of all members
PgrEdgeDisjointPathsGraph< G > Class Template Reference

#include "pgr_edgedisjointpaths.hpp"

Public Types

typedef boost::graph_traits< G >
::edge_descriptor 		E
 
typedef boost::graph_traits< G >
::edge_iterator 		E_it
 
typedef boost::graph_traits< G >
::out_edge_iterator 		Eout_it
 
typedef boost::graph_traits< G >
::vertex_descriptor 		V
 
typedef boost::graph_traits< G >
::vertex_iterator 		V_it
 

Public Member Functions

int64_t boykov_kolmogorov ()
 
void create_edge_disjoint_paths_graph (pgr_basic_edge_t *data_edges, size_t total_tuples, const std::set< int64_t > &source_vertices, const std::set< int64_t > &sink_vertices, bool directed)
 
void flow_dfs (V vertex, int64_t path_id, std::vector< std::vector< int64_t > > &paths)
 
V get_boost_vertex (int64_t id)
 
void get_edge_disjoint_paths (std::vector< General_path_element_t > &path_elements, int64_t flow)
 
int64_t get_edge_id (E e)
 
int64_t get_vertex_id (V v)
 

Public Attributes

G boost_graph
 
boost::property_map< G,
boost::edge_capacity_t >::type 		capacity
 
std::map< E, int64_t > E_to_id
 
std::map< int64_t, V > id_to_V
 
boost::property_map< G,
boost::edge_residual_capacity_t >
::type 		residual_capacity
 
boost::property_map< G,
boost::edge_reverse_t >::type 		rev
 
V sink_vertex
 
V source_vertex
 
std::map< V, int64_t > V_to_id
 

Detailed Description

template<class G>
class PgrEdgeDisjointPathsGraph< G >

Definition at line 57 of file pgr_edgedisjointpaths.hpp.

Member Typedef Documentation

template<class G>
typedef boost::graph_traits<G>::edge_descriptor PgrEdgeDisjointPathsGraph< G >::E

Definition at line 62 of file pgr_edgedisjointpaths.hpp.

template<class G>
typedef boost::graph_traits<G>::edge_iterator PgrEdgeDisjointPathsGraph< G >::E_it

Definition at line 64 of file pgr_edgedisjointpaths.hpp.

template<class G>
typedef boost::graph_traits<G>::out_edge_iterator PgrEdgeDisjointPathsGraph< G >::Eout_it

Definition at line 65 of file pgr_edgedisjointpaths.hpp.

template<class G>
typedef boost::graph_traits<G>::vertex_descriptor PgrEdgeDisjointPathsGraph< G >::V

Definition at line 61 of file pgr_edgedisjointpaths.hpp.

template<class G>
typedef boost::graph_traits<G>::vertex_iterator PgrEdgeDisjointPathsGraph< G >::V_it

Definition at line 63 of file pgr_edgedisjointpaths.hpp.

Member Function Documentation

template<class G>
int64_t PgrEdgeDisjointPathsGraph< G >::boykov_kolmogorov ( )
inline

Definition at line 91 of file pgr_edgedisjointpaths.hpp.

References PgrEdgeDisjointPathsGraph< G >::boost_graph, PgrEdgeDisjointPathsGraph< G >::sink_vertex, and PgrEdgeDisjointPathsGraph< G >::source_vertex.

Referenced by do_pgr_edge_disjoint_paths_many_to_many(), do_pgr_edge_disjoint_paths_many_to_one(), do_pgr_edge_disjoint_paths_one_to_many(), and do_pgr_edge_disjoint_paths_one_to_one().

template<class G>
void PgrEdgeDisjointPathsGraph< G >::create_edge_disjoint_paths_graph ( pgr_basic_edge_t *  data_edges,
size_t  total_tuples,
const std::set< int64_t > &  source_vertices,
const std::set< int64_t > &  sink_vertices,
bool  directed 
)
inline

Definition at line 100 of file pgr_edgedisjointpaths.hpp.

References PgrEdgeDisjointPathsGraph< G >::boost_graph, PgrEdgeDisjointPathsGraph< G >::capacity, pgr_basic_edge_t::coming, PgrEdgeDisjointPathsGraph< G >::E_to_id, PgrEdgeDisjointPathsGraph< G >::get_boost_vertex(), pgr_basic_edge_t::going, PgrEdgeDisjointPathsGraph< G >::id_to_V, PgrEdgeDisjointPathsGraph< G >::residual_capacity, PgrEdgeDisjointPathsGraph< G >::rev, PgrEdgeDisjointPathsGraph< G >::sink_vertex, PgrEdgeDisjointPathsGraph< G >::source_vertex, and PgrEdgeDisjointPathsGraph< G >::V_to_id.

Referenced by do_pgr_edge_disjoint_paths_many_to_many(), do_pgr_edge_disjoint_paths_many_to_one(), do_pgr_edge_disjoint_paths_one_to_many(), and do_pgr_edge_disjoint_paths_one_to_one().

template<class G>
void PgrEdgeDisjointPathsGraph< G >::flow_dfs ( V  vertex,
int64_t  path_id,
std::vector< std::vector< int64_t > > &  paths 
)
inline

Definition at line 195 of file pgr_edgedisjointpaths.hpp.

References PgrEdgeDisjointPathsGraph< G >::boost_graph, PgrEdgeDisjointPathsGraph< G >::capacity, PgrEdgeDisjointPathsGraph< G >::get_vertex_id(), PgrEdgeDisjointPathsGraph< G >::residual_capacity, and PgrEdgeDisjointPathsGraph< G >::sink_vertex.

Referenced by PgrEdgeDisjointPathsGraph< G >::get_edge_disjoint_paths().

template<class G>
V PgrEdgeDisjointPathsGraph< G >::get_boost_vertex ( int64_t  id)
inline

Definition at line 79 of file pgr_edgedisjointpaths.hpp.

References PgrEdgeDisjointPathsGraph< G >::id_to_V.

Referenced by PgrEdgeDisjointPathsGraph< G >::create_edge_disjoint_paths_graph(), and PgrEdgeDisjointPathsGraph< G >::get_edge_disjoint_paths().

template<class G>
void PgrEdgeDisjointPathsGraph< G >::get_edge_disjoint_paths ( std::vector< General_path_element_t > &  path_elements,
int64_t  flow 
)
inline

Definition at line 221 of file pgr_edgedisjointpaths.hpp.

References PgrEdgeDisjointPathsGraph< G >::boost_graph, PgrEdgeDisjointPathsGraph< G >::capacity, General_path_element_t::edge, General_path_element_t::end_id, PgrEdgeDisjointPathsGraph< G >::flow_dfs(), PgrEdgeDisjointPathsGraph< G >::get_boost_vertex(), PgrEdgeDisjointPathsGraph< G >::get_edge_id(), PgrEdgeDisjointPathsGraph< G >::get_vertex_id(), General_path_element_t::node, PgrEdgeDisjointPathsGraph< G >::residual_capacity, General_path_element_t::seq, PgrEdgeDisjointPathsGraph< G >::source_vertex, and General_path_element_t::start_id.

Referenced by do_pgr_edge_disjoint_paths_many_to_many(), do_pgr_edge_disjoint_paths_many_to_one(), do_pgr_edge_disjoint_paths_one_to_many(), and do_pgr_edge_disjoint_paths_one_to_one().

template<class G>
int64_t PgrEdgeDisjointPathsGraph< G >::get_edge_id ( E  e)
inline

Definition at line 87 of file pgr_edgedisjointpaths.hpp.

References PgrEdgeDisjointPathsGraph< G >::E_to_id.

Referenced by PgrEdgeDisjointPathsGraph< G >::get_edge_disjoint_paths().

template<class G>
int64_t PgrEdgeDisjointPathsGraph< G >::get_vertex_id ( V  v)
inline

Definition at line 83 of file pgr_edgedisjointpaths.hpp.

References PgrEdgeDisjointPathsGraph< G >::V_to_id.

Referenced by PgrEdgeDisjointPathsGraph< G >::flow_dfs(), and PgrEdgeDisjointPathsGraph< G >::get_edge_disjoint_paths().

Member Data Documentation

template<class G>
G PgrEdgeDisjointPathsGraph< G >::boost_graph

Definition at line 59 of file pgr_edgedisjointpaths.hpp.

Referenced by PgrEdgeDisjointPathsGraph< G >::boykov_kolmogorov(), PgrEdgeDisjointPathsGraph< G >::create_edge_disjoint_paths_graph(), PgrEdgeDisjointPathsGraph< G >::flow_dfs(), and PgrEdgeDisjointPathsGraph< G >::get_edge_disjoint_paths().

template<class G>
boost::property_map<G, boost::edge_capacity_t>::type PgrEdgeDisjointPathsGraph< G >::capacity

Definition at line 67 of file pgr_edgedisjointpaths.hpp.

Referenced by PgrEdgeDisjointPathsGraph< G >::create_edge_disjoint_paths_graph(), PgrEdgeDisjointPathsGraph< G >::flow_dfs(), and PgrEdgeDisjointPathsGraph< G >::get_edge_disjoint_paths().

template<class G>
std::map<E, int64_t> PgrEdgeDisjointPathsGraph< G >::E_to_id

Definition at line 74 of file pgr_edgedisjointpaths.hpp.

Referenced by PgrEdgeDisjointPathsGraph< G >::create_edge_disjoint_paths_graph(), and PgrEdgeDisjointPathsGraph< G >::get_edge_id().

template<class G>
std::map<int64_t, V> PgrEdgeDisjointPathsGraph< G >::id_to_V

Definition at line 72 of file pgr_edgedisjointpaths.hpp.

Referenced by PgrEdgeDisjointPathsGraph< G >::create_edge_disjoint_paths_graph(), and PgrEdgeDisjointPathsGraph< G >::get_boost_vertex().

template<class G>
boost::property_map<G, boost::edge_residual_capacity_t>::type PgrEdgeDisjointPathsGraph< G >::residual_capacity

Definition at line 70 of file pgr_edgedisjointpaths.hpp.

Referenced by PgrEdgeDisjointPathsGraph< G >::create_edge_disjoint_paths_graph(), PgrEdgeDisjointPathsGraph< G >::flow_dfs(), and PgrEdgeDisjointPathsGraph< G >::get_edge_disjoint_paths().

template<class G>
boost::property_map<G, boost::edge_reverse_t>::type PgrEdgeDisjointPathsGraph< G >::rev

Definition at line 68 of file pgr_edgedisjointpaths.hpp.

Referenced by PgrEdgeDisjointPathsGraph< G >::create_edge_disjoint_paths_graph().

template<class G>
V PgrEdgeDisjointPathsGraph< G >::sink_vertex

Definition at line 77 of file pgr_edgedisjointpaths.hpp.

Referenced by PgrEdgeDisjointPathsGraph< G >::boykov_kolmogorov(), PgrEdgeDisjointPathsGraph< G >::create_edge_disjoint_paths_graph(), and PgrEdgeDisjointPathsGraph< G >::flow_dfs().

template<class G>
V PgrEdgeDisjointPathsGraph< G >::source_vertex

Definition at line 76 of file pgr_edgedisjointpaths.hpp.

Referenced by PgrEdgeDisjointPathsGraph< G >::boykov_kolmogorov(), PgrEdgeDisjointPathsGraph< G >::create_edge_disjoint_paths_graph(), and PgrEdgeDisjointPathsGraph< G >::get_edge_disjoint_paths().

template<class G>
std::map<V, int64_t> PgrEdgeDisjointPathsGraph< G >::V_to_id

Definition at line 73 of file pgr_edgedisjointpaths.hpp.

Referenced by PgrEdgeDisjointPathsGraph< G >::create_edge_disjoint_paths_graph(), and PgrEdgeDisjointPathsGraph< G >::get_vertex_id().

The documentation for this class was generated from the following file: