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
PgrEdgeDisjointPathsGraph< G > Member List

This is the complete list of members for PgrEdgeDisjointPathsGraph< G >, including all inherited members.

boost_graphPgrEdgeDisjointPathsGraph< G >
boykov_kolmogorov()PgrEdgeDisjointPathsGraph< G >inline
capacityPgrEdgeDisjointPathsGraph< 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)PgrEdgeDisjointPathsGraph< G >inline
E typedefPgrEdgeDisjointPathsGraph< G >
E_it typedefPgrEdgeDisjointPathsGraph< G >
E_to_idPgrEdgeDisjointPathsGraph< G >
Eout_it typedefPgrEdgeDisjointPathsGraph< G >
flow_dfs(V vertex, int64_t path_id, std::vector< std::vector< int64_t > > &paths)PgrEdgeDisjointPathsGraph< G >inline
get_boost_vertex(int64_t id)PgrEdgeDisjointPathsGraph< G >inline
get_edge_disjoint_paths(std::vector< General_path_element_t > &path_elements, int64_t flow)PgrEdgeDisjointPathsGraph< G >inline
get_edge_id(E e)PgrEdgeDisjointPathsGraph< G >inline
get_vertex_id(V v)PgrEdgeDisjointPathsGraph< G >inline
id_to_VPgrEdgeDisjointPathsGraph< G >
residual_capacityPgrEdgeDisjointPathsGraph< G >
revPgrEdgeDisjointPathsGraph< G >
sink_vertexPgrEdgeDisjointPathsGraph< G >
source_vertexPgrEdgeDisjointPathsGraph< G >
V typedefPgrEdgeDisjointPathsGraph< G >
V_it typedefPgrEdgeDisjointPathsGraph< G >
V_to_idPgrEdgeDisjointPathsGraph< G >