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
pgrouting::graph::Pgr_contractionGraph< G, T_V, T_E > Member List

This is the complete list of members for pgrouting::graph::Pgr_contractionGraph< G, T_V, T_E >, including all inherited members.

add_contracted_edge_vertices(V v, T_E &e)pgrouting::graph::Pgr_contractionGraph< G, T_V, T_E >inline
B_G typedefpgrouting::graph::Pgr_base_graph< G, T_V, T_E >
compareById(const T_E &edge1, const T_E &edge2)pgrouting::graph::Pgr_contractionGraph< G, T_V, T_E >inlinestatic
degree_size_type typedefpgrouting::graph::Pgr_contractionGraph< G, T_V, T_E >
disconnect_edge(int64_t p_from, int64_t p_to)pgrouting::graph::Pgr_base_graph< G, T_V, T_E >
disconnect_out_going_edge(int64_t vertex_id, int64_t edge_id)pgrouting::graph::Pgr_base_graph< G, T_V, T_E >
disconnect_vertex(std::ostringstream &log, V vertex)pgrouting::graph::Pgr_contractionGraph< G, T_V, T_E >inline
Pgr_base_graph< G, T_V, T_E >::disconnect_vertex(int64_t p_vertex)pgrouting::graph::Pgr_base_graph< G, T_V, T_E >
Pgr_base_graph< G, T_V, T_E >::disconnect_vertex(V vertex)pgrouting::graph::Pgr_base_graph< G, T_V, T_E >
E typedefpgrouting::graph::Pgr_contractionGraph< G, T_V, T_E >
E_i typedefpgrouting::graph::Pgr_contractionGraph< G, T_V, T_E >
edges_size_type typedefpgrouting::graph::Pgr_base_graph< G, T_V, T_E >
EI_i typedefpgrouting::graph::Pgr_contractionGraph< G, T_V, T_E >
EO_i typedefpgrouting::graph::Pgr_contractionGraph< G, T_V, T_E >
find_adjacent_vertex(V v) const pgrouting::graph::Pgr_contractionGraph< G, T_V, T_E >inline
find_adjacent_vertices(V v) const pgrouting::graph::Pgr_contractionGraph< G, T_V, T_E >inline
get_changed_vertices(Identifiers< int64_t > &remaining_vertices)pgrouting::graph::Pgr_contractionGraph< G, T_V, T_E >inline
get_contracted_vertices(std::ostringstream &log, int64_t vid)pgrouting::graph::Pgr_contractionGraph< G, T_V, T_E >inline
get_contracted_vertices(int64_t **contracted_vertices, int &contracted_vertices_size, int64_t vid)pgrouting::graph::Pgr_contractionGraph< G, T_V, T_E >inline
get_edge_id(V from, V to, double &distance) constpgrouting::graph::Pgr_base_graph< G, T_V, T_E >
get_ids(std::ostringstream &log, Identifiers< int64_t > boost_ids)pgrouting::graph::Pgr_contractionGraph< G, T_V, T_E >inline
get_ids(int64_t **contracted_vertices, int &contracted_vertices_size, Identifiers< int64_t > boost_ids)pgrouting::graph::Pgr_contractionGraph< G, T_V, T_E >inline
get_min_cost_edge(V source, V destination)pgrouting::graph::Pgr_contractionGraph< G, T_V, T_E >inline
get_remaining_vertices(std::vector< T_V > &remaining_vertices)pgrouting::graph::Pgr_contractionGraph< G, T_V, T_E >inline
get_shortcuts(std::vector< T_E > &shortcut_edges)pgrouting::graph::Pgr_contractionGraph< G, T_V, T_E >inline
get_V(const T_V &vertex)pgrouting::graph::Pgr_base_graph< G, T_V, T_E >inline
get_V(int64_t vid) constpgrouting::graph::Pgr_base_graph< G, T_V, T_E >inline
graphpgrouting::graph::Pgr_base_graph< G, T_V, T_E >
graph_add_edge(const T &edge)pgrouting::graph::Pgr_contractionGraph< G, T_V, T_E >inline
Pgr_base_graph< G, T_V, T_E >::graph_add_edge(const T_E &edge)pgrouting::graph::Pgr_base_graph< G, T_V, T_E >
graph_add_shortcut(const T_E &edge, std::ostringstream &log)pgrouting::graph::Pgr_contractionGraph< G, T_V, T_E >inline
graph_insert_data(const T *edges, int64_t count)pgrouting::graph::Pgr_contractionGraph< G, T_V, T_E >inline
graph_insert_data(const std::vector< T > &edges)pgrouting::graph::Pgr_contractionGraph< G, T_V, T_E >inline
has_vertex(int64_t vid) constpgrouting::graph::Pgr_base_graph< G, T_V, T_E >inline
id_to_V typedefpgrouting::graph::Pgr_contractionGraph< G, T_V, T_E >
in_degree(V &v) constpgrouting::graph::Pgr_base_graph< G, T_V, T_E >inline
in_degree_from_vertex(V vertex, V neighbor)pgrouting::graph::Pgr_contractionGraph< G, T_V, T_E >inline
is_connected(int64_t v) const pgrouting::graph::Pgr_contractionGraph< G, T_V, T_E >inline
LI typedefpgrouting::graph::Pgr_contractionGraph< G, T_V, T_E >
m_gTypepgrouting::graph::Pgr_base_graph< G, T_V, T_E >
m_num_verticespgrouting::graph::Pgr_base_graph< G, T_V, T_E >
num_vertices() constpgrouting::graph::Pgr_base_graph< G, T_V, T_E >inline
operator[](V v)pgrouting::graph::Pgr_contractionGraph< G, T_V, T_E >inline
operator[](E e)pgrouting::graph::Pgr_contractionGraph< G, T_V, T_E >inline
Pgr_base_graph< G, T_V, T_E >::operator[](V v) constpgrouting::graph::Pgr_base_graph< G, T_V, T_E >inline
out_degree(int64_t vertex_id) constpgrouting::graph::Pgr_base_graph< G, T_V, T_E >inline
out_degree(V &v) constpgrouting::graph::Pgr_base_graph< G, T_V, T_E >inline
out_degree_to_vertex(V vertex, V neighbor)pgrouting::graph::Pgr_contractionGraph< G, T_V, T_E >inline
Pgr_base_graph(const std::vector< T_V > &vertices, graphType gtype)pgrouting::graph::Pgr_base_graph< G, T_V, T_E >inline
Pgr_base_graph(graphType gtype)pgrouting::graph::Pgr_base_graph< G, T_V, T_E >inlineexplicit
Pgr_contractionGraph(const std::vector< T_V > &vertices, graphType gtype)pgrouting::graph::Pgr_contractionGraph< G, T_V, T_E >inline
Pgr_contractionGraph(graphType gtype)pgrouting::graph::Pgr_contractionGraph< G, T_V, T_E >inlineexplicit
print_graph(std::ostringstream &log)pgrouting::graph::Pgr_contractionGraph< G, T_V, T_E >inline
print_shortcuts(std::ostringstream &log)pgrouting::graph::Pgr_contractionGraph< G, T_V, T_E >inline
removed_edgespgrouting::graph::Pgr_base_graph< G, T_V, T_E >
removed_verticespgrouting::graph::Pgr_contractionGraph< G, T_V, T_E >
restore_graph()pgrouting::graph::Pgr_base_graph< G, T_V, T_E >
shortcutspgrouting::graph::Pgr_contractionGraph< G, T_V, T_E >
V typedefpgrouting::graph::Pgr_contractionGraph< G, T_V, T_E >
V_i typedefpgrouting::graph::Pgr_contractionGraph< G, T_V, T_E >
vertices_mappgrouting::graph::Pgr_base_graph< G, T_V, T_E >
vertices_size_type typedefpgrouting::graph::Pgr_base_graph< G, T_V, T_E >