PGROUTING  2.6-dev
pgrouting::graph::Pgr_componentsGraph< G, T_V, T_E > Member List

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

adjacent(V v_idx, E e_idx) const pgrouting::graph::Pgr_base_graph< G, T_V, T_E >inline
B_G typedefpgrouting::graph::Pgr_base_graph< G, T_V, T_E >
degree_size_type typedefpgrouting::graph::Pgr_base_graph< 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_base_graph< G, T_V, T_E >
E_i typedefpgrouting::graph::Pgr_base_graph< G, T_V, T_E >
edges_size_type typedefpgrouting::graph::Pgr_base_graph< G, T_V, T_E >
EI_i typedefpgrouting::graph::Pgr_base_graph< G, T_V, T_E >
EO_i typedefpgrouting::graph::Pgr_base_graph< G, T_V, T_E >
G_T_E typedefpgrouting::graph::Pgr_base_graph< G, T_V, T_E >
G_T_V typedefpgrouting::graph::Pgr_base_graph< G, T_V, T_E >
get_edge_id(V from, V to, double &distance) const pgrouting::graph::Pgr_base_graph< G, T_V, T_E >
get_V(const T_V &vertex)pgrouting::graph::Pgr_base_graph< G, T_V, T_E >inline
get_V(int64_t vid) const pgrouting::graph::Pgr_base_graph< G, T_V, T_E >inline
graphpgrouting::graph::Pgr_componentsGraph< G, T_V, T_E >
graph_add_edge(const T &edge)pgrouting::graph::Pgr_componentsGraph< G, T_V, T_E >inlineprivate
pgrouting::graph::Pgr_base_graph::graph_add_edge(const T_E &edge)pgrouting::graph::Pgr_base_graph< G, T_V, T_E >
pgrouting::graph::Pgr_base_graph::graph_add_edge(const T &edge, bool normal=true)pgrouting::graph::Pgr_base_graph< G, T_V, T_E >
graph_add_edge_no_create_vertex(const T &edge)pgrouting::graph::Pgr_base_graph< G, T_V, T_E >inline
has_vertex(int64_t vid) const pgrouting::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) const pgrouting::graph::Pgr_base_graph< G, T_V, T_E >inline
in_degree(V &v) const pgrouting::graph::Pgr_base_graph< G, T_V, T_E >inline
IndexMap typedefpgrouting::graph::Pgr_base_graph< G, T_V, T_E >
insert_edges(const T *edges, int64_t count)pgrouting::graph::Pgr_componentsGraph< G, T_V, T_E >inline
insert_edges(const std::vector< T > &edges)pgrouting::graph::Pgr_componentsGraph< G, T_V, T_E >inline
pgrouting::graph::Pgr_base_graph::insert_edges(T *edges, int64_t count, bool)pgrouting::graph::Pgr_base_graph< G, T_V, T_E >inline
pgrouting::graph::Pgr_base_graph::insert_edges(const std::vector< T > &edges, bool normal=true)pgrouting::graph::Pgr_base_graph< G, T_V, T_E >inline
insert_edges_neg(const T *edges, int64_t count)pgrouting::graph::Pgr_base_graph< G, T_V, T_E >inline
is_directed() const pgrouting::graph::Pgr_base_graph< G, T_V, T_E >inline
is_source(V v_idx, E e_idx) const pgrouting::graph::Pgr_base_graph< G, T_V, T_E >inline
is_target(V v_idx, E e_idx) const pgrouting::graph::Pgr_base_graph< G, T_V, T_E >inline
is_undirected() const pgrouting::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 >
mapIndexpgrouting::graph::Pgr_base_graph< G, T_V, T_E >
num_edges() const pgrouting::graph::Pgr_base_graph< G, T_V, T_E >inline
num_vertices() const pgrouting::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) const pgrouting::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) const pgrouting::graph::Pgr_base_graph< G, T_V, T_E >inline
out_degree(int64_t vertex_id) const pgrouting::graph::Pgr_base_graph< G, T_V, T_E >inline
out_degree(V &v) const pgrouting::graph::Pgr_base_graph< 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_componentsGraph(graphType gtype)pgrouting::graph::Pgr_componentsGraph< G, T_V, T_E >inlineexplicit
propmapIndexpgrouting::graph::Pgr_base_graph< G, T_V, T_E >
removed_edgespgrouting::graph::Pgr_base_graph< G, T_V, T_E >
restore_graph()pgrouting::graph::Pgr_base_graph< G, T_V, T_E >
source(E e_idx) const pgrouting::graph::Pgr_base_graph< G, T_V, T_E >inline
target(E e_idx) const pgrouting::graph::Pgr_base_graph< G, T_V, T_E >inline
V typedefpgrouting::graph::Pgr_base_graph< G, T_V, T_E >
V_i typedefpgrouting::graph::Pgr_base_graph< 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 >
vertIndexpgrouting::graph::Pgr_base_graph< G, T_V, T_E >