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_base_graph< G, Vertex, Edge > Member List

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

add_vertices(std::vector< T_V > vertices)pgrouting::graph::Pgr_base_graph< G, Vertex, Edge >private
B_G typedefpgrouting::graph::Pgr_base_graph< G, Vertex, Edge >
degree_size_type typedefpgrouting::graph::Pgr_base_graph< G, Vertex, Edge >
disconnect_edge(int64_t p_from, int64_t p_to)pgrouting::graph::Pgr_base_graph< G, Vertex, Edge >
disconnect_out_going_edge(int64_t vertex_id, int64_t edge_id)pgrouting::graph::Pgr_base_graph< G, Vertex, Edge >
disconnect_vertex(int64_t p_vertex)pgrouting::graph::Pgr_base_graph< G, Vertex, Edge >
disconnect_vertex(V vertex)pgrouting::graph::Pgr_base_graph< G, Vertex, Edge >
E typedefpgrouting::graph::Pgr_base_graph< G, Vertex, Edge >
E_i typedefpgrouting::graph::Pgr_base_graph< G, Vertex, Edge >
edges_size_type typedefpgrouting::graph::Pgr_base_graph< G, Vertex, Edge >
EI_i typedefpgrouting::graph::Pgr_base_graph< G, Vertex, Edge >
EO_i typedefpgrouting::graph::Pgr_base_graph< G, Vertex, Edge >
get_edge_id(V from, V to, double &distance) const pgrouting::graph::Pgr_base_graph< G, Vertex, Edge >
get_V(const T_V &vertex)pgrouting::graph::Pgr_base_graph< G, Vertex, Edge >inline
get_V(int64_t vid) const pgrouting::graph::Pgr_base_graph< G, Vertex, Edge >inline
graphpgrouting::graph::Pgr_base_graph< G, Vertex, Edge >
graph_add_edge(const T_E &edge)pgrouting::graph::Pgr_base_graph< G, Vertex, Edge >
graph_add_edge(const T &edge)pgrouting::graph::Pgr_base_graph< G, Vertex, Edge >
graph_insert_data(const T *edges, int64_t count)pgrouting::graph::Pgr_base_graph< G, Vertex, Edge >inline
graph_insert_data(const std::vector< T > &edges)pgrouting::graph::Pgr_base_graph< G, Vertex, Edge >inline
has_vertex(int64_t vid) const pgrouting::graph::Pgr_base_graph< G, Vertex, Edge >inline
id_to_V typedefpgrouting::graph::Pgr_base_graph< G, Vertex, Edge >
in_degree(V &v) const pgrouting::graph::Pgr_base_graph< G, Vertex, Edge >inline
LI typedefpgrouting::graph::Pgr_base_graph< G, Vertex, Edge >
m_gTypepgrouting::graph::Pgr_base_graph< G, Vertex, Edge >
m_num_verticespgrouting::graph::Pgr_base_graph< G, Vertex, Edge >
num_vertices() const pgrouting::graph::Pgr_base_graph< G, Vertex, Edge >inline
operator<<(std::ostream &log, const Pgr_base_graph< G, T_V, T_E > &g)pgrouting::graph::Pgr_base_graph< G, Vertex, Edge >friend
operator[](V v) const pgrouting::graph::Pgr_base_graph< G, Vertex, Edge >inline
out_degree(int64_t vertex_id) const pgrouting::graph::Pgr_base_graph< G, Vertex, Edge >inline
out_degree(V &v) const pgrouting::graph::Pgr_base_graph< G, Vertex, Edge >inline
Pgr_base_graph(const std::vector< T_V > &vertices, graphType gtype)pgrouting::graph::Pgr_base_graph< G, Vertex, Edge >inline
Pgr_base_graph(graphType gtype)pgrouting::graph::Pgr_base_graph< G, Vertex, Edge >inlineexplicit
removed_edgespgrouting::graph::Pgr_base_graph< G, Vertex, Edge >
restore_graph()pgrouting::graph::Pgr_base_graph< G, Vertex, Edge >
V typedefpgrouting::graph::Pgr_base_graph< G, Vertex, Edge >
V_i typedefpgrouting::graph::Pgr_base_graph< G, Vertex, Edge >
vertices_mappgrouting::graph::Pgr_base_graph< G, Vertex, Edge >
vertices_size_type typedefpgrouting::graph::Pgr_base_graph< G, Vertex, Edge >