| add_vertices(std::vector< T_V > vertices) | pgrouting::graph::Pgr_base_graph< G, T_V, T_E > | inlineprivate |
| adjacent(V v_idx, E e_idx) const | pgrouting::graph::Pgr_base_graph< G, T_V, T_E > | inline |
| B_G typedef | pgrouting::graph::Pgr_base_graph< G, T_V, T_E > | |
| degree_size_type typedef | pgrouting::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 typedef | pgrouting::graph::Pgr_base_graph< G, T_V, T_E > | |
| E_i typedef | pgrouting::graph::Pgr_base_graph< G, T_V, T_E > | |
| edges_size_type typedef | pgrouting::graph::Pgr_base_graph< G, T_V, T_E > | |
| EI_i typedef | pgrouting::graph::Pgr_base_graph< G, T_V, T_E > | |
| EO_i typedef | pgrouting::graph::Pgr_base_graph< G, T_V, T_E > | |
| G_T_E typedef | pgrouting::graph::Pgr_base_graph< G, T_V, T_E > | |
| G_T_V typedef | pgrouting::graph::Pgr_base_graph< G, T_V, T_E > | |
| get_edge(V from, V to, double &distance) const | pgrouting::graph::Pgr_base_graph< G, T_V, T_E > | inline |
| 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 |
| graph | pgrouting::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, 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 |
| graph_add_min_edge_no_parallel(const T &edge) | pgrouting::graph::Pgr_base_graph< G, T_V, T_E > | |
| graph_add_neg_edge(const T &edge, bool normal=true) | pgrouting::graph::Pgr_base_graph< G, T_V, T_E > | |
| has_vertex(int64_t vid) const | pgrouting::graph::Pgr_base_graph< G, T_V, T_E > | inline |
| id_to_V typedef | pgrouting::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 typedef | pgrouting::graph::Pgr_base_graph< G, T_V, T_E > | |
| insert_edges(const T *edges, size_t count) | pgrouting::graph::Pgr_base_graph< G, T_V, T_E > | inline |
| insert_edges(T *edges, size_t count, bool) | pgrouting::graph::Pgr_base_graph< G, T_V, T_E > | inline |
| 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, size_t count) | pgrouting::graph::Pgr_base_graph< G, T_V, T_E > | inline |
| insert_min_edges_no_parallel(const T *edges, size_t count) | pgrouting::graph::Pgr_base_graph< G, T_V, T_E > | inline |
| insert_min_edges_no_parallel(const std::vector< T > &edges) | pgrouting::graph::Pgr_base_graph< G, T_V, T_E > | inline |
| insert_negative_edges(const T *edges, int64_t count) | pgrouting::graph::Pgr_base_graph< G, T_V, T_E > | inline |
| insert_negative_edges(const std::vector< T > &edges, bool normal=true) | 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 typedef | pgrouting::graph::Pgr_base_graph< G, T_V, T_E > | |
| m_gType | pgrouting::graph::Pgr_base_graph< G, T_V, T_E > | |
| mapIndex | pgrouting::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<<(std::ostream &log, const Pgr_base_graph< G, T_V, T_E > &g) | pgrouting::graph::Pgr_base_graph< G, T_V, T_E > | friend |
| 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 |
| propmapIndex | pgrouting::graph::Pgr_base_graph< G, T_V, T_E > | |
| removed_edges | pgrouting::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 typedef | pgrouting::graph::Pgr_base_graph< G, T_V, T_E > | |
| V_i typedef | pgrouting::graph::Pgr_base_graph< G, T_V, T_E > | |
| vertices_map | pgrouting::graph::Pgr_base_graph< G, T_V, T_E > | |
| vertices_size_type typedef | pgrouting::graph::Pgr_base_graph< G, T_V, T_E > | |
| vertIndex | pgrouting::graph::Pgr_base_graph< G, T_V, T_E > | |
1.8.17