PGROUTING  3.2
pgrouting::graph::Pgr_contractionGraph< G > Member List

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

add_shortcut(const CH_edge &edge, V u, V v)pgrouting::graph::Pgr_contractionGraph< G >inline
add_vertices(std::vector< CH_vertex > vertices)pgrouting::graph::Pgr_base_graph< G, CH_vertex, CH_edge >inlineprivate
adjacent(V v_idx, E e_idx) constpgrouting::graph::Pgr_base_graph< G, CH_vertex, CH_edge >inline
B_G typedefpgrouting::graph::Pgr_base_graph< G, CH_vertex, CH_edge >
degree_size_type typedefpgrouting::graph::Pgr_base_graph< G, CH_vertex, CH_edge >
disconnect_edge(int64_t p_from, int64_t p_to)pgrouting::graph::Pgr_base_graph< G, CH_vertex, CH_edge >
disconnect_out_going_edge(int64_t vertex_id, int64_t edge_id)pgrouting::graph::Pgr_base_graph< G, CH_vertex, CH_edge >
disconnect_vertex(int64_t p_vertex)pgrouting::graph::Pgr_base_graph< G, CH_vertex, CH_edge >
disconnect_vertex(V vertex)pgrouting::graph::Pgr_base_graph< G, CH_vertex, CH_edge >
E typedefpgrouting::graph::Pgr_contractionGraph< G >
E_i typedefpgrouting::graph::Pgr_base_graph< G, CH_vertex, CH_edge >
edges_size_type typedefpgrouting::graph::Pgr_base_graph< G, CH_vertex, CH_edge >
EI_i typedefpgrouting::graph::Pgr_contractionGraph< G >
EO_i typedefpgrouting::graph::Pgr_contractionGraph< G >
find_adjacent_vertices(V v) constpgrouting::graph::Pgr_contractionGraph< G >inline
G_T_E typedefpgrouting::graph::Pgr_base_graph< G, CH_vertex, CH_edge >
G_T_V typedefpgrouting::graph::Pgr_base_graph< G, CH_vertex, CH_edge >
get_edge(V from, V to, double &distance) constpgrouting::graph::Pgr_base_graph< G, CH_vertex, CH_edge >inline
get_edge_id(V from, V to, double &distance) constpgrouting::graph::Pgr_base_graph< G, CH_vertex, CH_edge >
get_min_cost_edge(V u, V v)pgrouting::graph::Pgr_contractionGraph< G >inline
get_V(const CH_vertex &vertex)pgrouting::graph::Pgr_base_graph< G, CH_vertex, CH_edge >inline
get_V(int64_t vid) constpgrouting::graph::Pgr_base_graph< G, CH_vertex, CH_edge >inline
graphpgrouting::graph::Pgr_base_graph< G, CH_vertex, CH_edge >
graph_add_edge(const CH_edge &edge)pgrouting::graph::Pgr_base_graph< G, CH_vertex, CH_edge >
graph_add_edge(const T &edge, bool normal=true)pgrouting::graph::Pgr_base_graph< G, CH_vertex, CH_edge >
graph_add_edge_no_create_vertex(const T &edge)pgrouting::graph::Pgr_base_graph< G, CH_vertex, CH_edge >inline
graph_add_min_edge_no_parallel(const T &edge)pgrouting::graph::Pgr_base_graph< G, CH_vertex, CH_edge >
graph_add_neg_edge(const T &edge, bool normal=true)pgrouting::graph::Pgr_base_graph< G, CH_vertex, CH_edge >
has_u_v_w(V u, V v, V w) constpgrouting::graph::Pgr_contractionGraph< G >inline
has_vertex(int64_t vid) constpgrouting::graph::Pgr_base_graph< G, CH_vertex, CH_edge >inline
id_to_V typedefpgrouting::graph::Pgr_base_graph< G, CH_vertex, CH_edge >
in_degree(int64_t vertex_id) constpgrouting::graph::Pgr_base_graph< G, CH_vertex, CH_edge >inline
in_degree(V &v) constpgrouting::graph::Pgr_base_graph< G, CH_vertex, CH_edge >inline
IndexMap typedefpgrouting::graph::Pgr_base_graph< G, CH_vertex, CH_edge >
insert_edges(const T *edges, size_t count)pgrouting::graph::Pgr_base_graph< G, CH_vertex, CH_edge >inline
insert_edges(T *edges, size_t count, bool)pgrouting::graph::Pgr_base_graph< G, CH_vertex, CH_edge >inline
insert_edges(const std::vector< T > &edges, bool normal=true)pgrouting::graph::Pgr_base_graph< G, CH_vertex, CH_edge >inline
insert_edges_neg(const T *edges, size_t count)pgrouting::graph::Pgr_base_graph< G, CH_vertex, CH_edge >inline
insert_min_edges_no_parallel(const T *edges, size_t count)pgrouting::graph::Pgr_base_graph< G, CH_vertex, CH_edge >inline
insert_min_edges_no_parallel(const std::vector< T > &edges)pgrouting::graph::Pgr_base_graph< G, CH_vertex, CH_edge >inline
insert_negative_edges(const T *edges, int64_t count)pgrouting::graph::Pgr_base_graph< G, CH_vertex, CH_edge >inline
insert_negative_edges(const std::vector< T > &edges, bool normal=true)pgrouting::graph::Pgr_base_graph< G, CH_vertex, CH_edge >inline
is_directed() constpgrouting::graph::Pgr_base_graph< G, CH_vertex, CH_edge >inline
is_linear(V v)pgrouting::graph::Pgr_contractionGraph< G >inline
is_shortcut_possible(V u, V v, V w)pgrouting::graph::Pgr_contractionGraph< G >inline
is_source(V v_idx, E e_idx) constpgrouting::graph::Pgr_base_graph< G, CH_vertex, CH_edge >inline
is_target(V v_idx, E e_idx) constpgrouting::graph::Pgr_base_graph< G, CH_vertex, CH_edge >inline
is_undirected() constpgrouting::graph::Pgr_base_graph< G, CH_vertex, CH_edge >inline
LI typedefpgrouting::graph::Pgr_base_graph< G, CH_vertex, CH_edge >
m_gTypepgrouting::graph::Pgr_base_graph< G, CH_vertex, CH_edge >
mapIndexpgrouting::graph::Pgr_base_graph< G, CH_vertex, CH_edge >
num_edges() constpgrouting::graph::Pgr_base_graph< G, CH_vertex, CH_edge >inline
num_vertices() constpgrouting::graph::Pgr_base_graph< G, CH_vertex, CH_edge >inline
operator<<(std::ostream &os, const Pgr_contractionGraph &g)pgrouting::graph::Pgr_contractionGraph< G >friend
operator[](E e_idx)pgrouting::graph::Pgr_base_graph< G, CH_vertex, CH_edge >inline
operator[](E e_idx) constpgrouting::graph::Pgr_base_graph< G, CH_vertex, CH_edge >inline
operator[](V v_idx)pgrouting::graph::Pgr_base_graph< G, CH_vertex, CH_edge >inline
operator[](V v_idx) constpgrouting::graph::Pgr_base_graph< G, CH_vertex, CH_edge >inline
out_degree(int64_t vertex_id) constpgrouting::graph::Pgr_base_graph< G, CH_vertex, CH_edge >inline
out_degree(V &v) constpgrouting::graph::Pgr_base_graph< G, CH_vertex, CH_edge >inline
Pgr_base_graph(const std::vector< CH_vertex > &vertices, graphType gtype)pgrouting::graph::Pgr_base_graph< G, CH_vertex, CH_edge >inline
Pgr_base_graph(graphType gtype)pgrouting::graph::Pgr_base_graph< G, CH_vertex, CH_edge >inlineexplicit
Pgr_contractionGraph(graphType gtype)pgrouting::graph::Pgr_contractionGraph< G >inlineexplicit
propmapIndexpgrouting::graph::Pgr_base_graph< G, CH_vertex, CH_edge >
removed_edgespgrouting::graph::Pgr_base_graph< G, CH_vertex, CH_edge >
restore_graph()pgrouting::graph::Pgr_base_graph< G, CH_vertex, CH_edge >
source(E e_idx) constpgrouting::graph::Pgr_base_graph< G, CH_vertex, CH_edge >inline
target(E e_idx) constpgrouting::graph::Pgr_base_graph< G, CH_vertex, CH_edge >inline
V typedefpgrouting::graph::Pgr_contractionGraph< G >
V_i typedefpgrouting::graph::Pgr_base_graph< G, CH_vertex, CH_edge >
vertices_mappgrouting::graph::Pgr_base_graph< G, CH_vertex, CH_edge >
vertices_size_type typedefpgrouting::graph::Pgr_base_graph< G, CH_vertex, CH_edge >
vertIndexpgrouting::graph::Pgr_base_graph< G, CH_vertex, CH_edge >