PGROUTING  2.4
 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
add_shortcut(const T_E &edge)pgrouting::graph::Pgr_contractionGraph< G, T_V, T_E >inline
adjacent(V v_idx, E e_idx) constpgrouting::graph::Pgr_base_graph< 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(int64_t p_vertex)pgrouting::graph::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_vertices(V v) const pgrouting::graph::Pgr_contractionGraph< G, T_V, T_E >inline
G_T_E typedefpgrouting::graph::Pgr_base_graph< G, T_V, T_E >
get_changed_vertices()pgrouting::graph::Pgr_contractionGraph< G, T_V, T_E >inline
get_contracted_vertices(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(Identifiers< int64_t > boost_ids) const 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_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_E &edge)pgrouting::graph::Pgr_base_graph< G, T_V, T_E >
graph_add_edge(const T &edge)pgrouting::graph::Pgr_base_graph< G, T_V, T_E >
has_vertex(int64_t vid) constpgrouting::graph::Pgr_base_graph< G, T_V, T_E >inline
id_to_V typedefpgrouting::graph::Pgr_base_graph< G, T_V, T_E >
in_degree(int64_t vertex_id) constpgrouting::graph::Pgr_base_graph< G, T_V, T_E >inline
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
insert_edges(const T *edges, int64_t count)pgrouting::graph::Pgr_base_graph< G, T_V, T_E >inline
insert_edges(const std::vector< T > &edges)pgrouting::graph::Pgr_base_graph< G, T_V, T_E >inline
is_directed() constpgrouting::graph::Pgr_base_graph< G, T_V, T_E >inline
is_source(V v_idx, E e_idx) constpgrouting::graph::Pgr_base_graph< G, T_V, T_E >inline
is_target(V v_idx, E e_idx) constpgrouting::graph::Pgr_base_graph< G, T_V, T_E >inline
is_undirected() constpgrouting::graph::Pgr_base_graph< G, T_V, T_E >inline
LI typedefpgrouting::graph::Pgr_base_graph< 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[](E e_idx)pgrouting::graph::Pgr_base_graph< G, T_V, T_E >inline
operator[](E e_idx) constpgrouting::graph::Pgr_base_graph< G, T_V, T_E >inline
operator[](V v_idx)pgrouting::graph::Pgr_base_graph< G, T_V, T_E >inline
operator[](V v_idx) 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(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
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 >
source(E e_idx) constpgrouting::graph::Pgr_base_graph< G, T_V, T_E >inline
target(E e_idx) constpgrouting::graph::Pgr_base_graph< G, T_V, T_E >inline
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 >