| add_edge(int id) | nuri::Subgraph< NT, ET, is_const > | inline |
| add_edges(const internal::IndexSet &edges) | nuri::Subgraph< NT, ET, is_const > | inline |
| add_node(int id) | nuri::Subgraph< NT, ET, is_const > | inline |
| add_nodes(const internal::IndexSet &nodes) | nuri::Subgraph< NT, ET, is_const > | inline |
| add_nodes_with_edges(const internal::IndexSet &nodes) | nuri::Subgraph< NT, ET, is_const > | inline |
| adj_begin(int idx) | nuri::Subgraph< NT, ET, is_const > | inline |
| adj_begin(int idx) const | nuri::Subgraph< NT, ET, is_const > | inline |
| adj_cbegin(int idx) const | nuri::Subgraph< NT, ET, is_const > | inline |
| adj_cend(int idx) const | nuri::Subgraph< NT, ET, is_const > | inline |
| adj_end(int idx) | nuri::Subgraph< NT, ET, is_const > | inline |
| adj_end(int idx) const | nuri::Subgraph< NT, ET, is_const > | inline |
| adjacency_iterator typedef | nuri::Subgraph< NT, ET, is_const > | |
| AdjRef typedef | nuri::Subgraph< NT, ET, is_const > | |
| begin() | nuri::Subgraph< NT, ET, is_const > | inline |
| begin() const | nuri::Subgraph< NT, ET, is_const > | inline |
| cbegin() const | nuri::Subgraph< NT, ET, is_const > | inline |
| cend() const | nuri::Subgraph< NT, ET, is_const > | inline |
| clear() noexcept | nuri::Subgraph< NT, ET, is_const > | inline |
| clear_edges() noexcept | nuri::Subgraph< NT, ET, is_const > | inline |
| const_adjacency_iterator typedef | nuri::Subgraph< NT, ET, is_const > | |
| const_edge_iterator typedef | nuri::Subgraph< NT, ET, is_const > | |
| const_iterator typedef | nuri::Subgraph< NT, ET, is_const > | |
| const_node_iterator typedef | nuri::Subgraph< NT, ET, is_const > | |
| ConstAdjRef typedef | nuri::Subgraph< NT, ET, is_const > | |
| ConstEdgeRef typedef | nuri::Subgraph< NT, ET, is_const > | |
| ConstEdgesWrapper typedef | nuri::Subgraph< NT, ET, is_const > | |
| ConstNodeRef typedef | nuri::Subgraph< NT, ET, is_const > | |
| contains_edge(int id) const | nuri::Subgraph< NT, ET, is_const > | inline |
| contains_edge(typename graph_type::ConstEdgeRef edge) const | nuri::Subgraph< NT, ET, is_const > | inline |
| contains_node(int id) const | nuri::Subgraph< NT, ET, is_const > | inline |
| contains_node(typename graph_type::ConstNodeRef node) const | nuri::Subgraph< NT, ET, is_const > | inline |
| degree(int idx) const | nuri::Subgraph< NT, ET, is_const > | inline |
| edge(int idx) | nuri::Subgraph< NT, ET, is_const > | inline |
| edge(int idx) const | nuri::Subgraph< NT, ET, is_const > | inline |
| edge_begin() | nuri::Subgraph< NT, ET, is_const > | inline |
| edge_begin() const | nuri::Subgraph< NT, ET, is_const > | inline |
| edge_cbegin() const | nuri::Subgraph< NT, ET, is_const > | inline |
| edge_cend() const | nuri::Subgraph< NT, ET, is_const > | inline |
| edge_data(int idx) | nuri::Subgraph< NT, ET, is_const > | inline |
| edge_data(int idx) const | nuri::Subgraph< NT, ET, is_const > | inline |
| edge_data_type typedef | nuri::Subgraph< NT, ET, is_const > | |
| edge_end() | nuri::Subgraph< NT, ET, is_const > | inline |
| edge_end() const | nuri::Subgraph< NT, ET, is_const > | inline |
| edge_ids() const | nuri::Subgraph< NT, ET, is_const > | inline |
| edge_iterator typedef | nuri::Subgraph< NT, ET, is_const > | |
| EdgeRef typedef | nuri::Subgraph< NT, ET, is_const > | |
| edges() | nuri::Subgraph< NT, ET, is_const > | inline |
| edges() const | nuri::Subgraph< NT, ET, is_const > | inline |
| EdgesWrapper typedef | nuri::Subgraph< NT, ET, is_const > | |
| empty() const | nuri::Subgraph< NT, ET, is_const > | inline |
| end() | nuri::Subgraph< NT, ET, is_const > | inline |
| end() const | nuri::Subgraph< NT, ET, is_const > | inline |
| erase_edge(int idx) | nuri::Subgraph< NT, ET, is_const > | inline |
| erase_edge(ConstEdgeRef edge) | nuri::Subgraph< NT, ET, is_const > | inline |
| erase_edge_of(int id) | nuri::Subgraph< NT, ET, is_const > | inline |
| erase_edge_of(typename graph_type::ConstEdgeRef edge) | nuri::Subgraph< NT, ET, is_const > | inline |
| erase_edges(const_edge_iterator begin, const_edge_iterator end) | nuri::Subgraph< NT, ET, is_const > | inline |
| erase_edges_if(UnaryPred &&pred) | nuri::Subgraph< NT, ET, is_const > | inline |
| erase_node(int idx) | nuri::Subgraph< NT, ET, is_const > | inline |
| erase_node(ConstNodeRef node) | nuri::Subgraph< NT, ET, is_const > | inline |
| erase_node_of(int id) | nuri::Subgraph< NT, ET, is_const > | inline |
| erase_node_of(typename graph_type::ConstNodeRef node) | nuri::Subgraph< NT, ET, is_const > | inline |
| erase_nodes(const_iterator begin, const_iterator end) | nuri::Subgraph< NT, ET, is_const > | inline |
| erase_nodes_if(UnaryPred pred) | nuri::Subgraph< NT, ET, is_const > | inline |
| find_adjacent(ConstNodeRef src, ConstNodeRef dst) | nuri::Subgraph< NT, ET, is_const > | inline |
| find_adjacent(ConstNodeRef src, ConstNodeRef dst) const | nuri::Subgraph< NT, ET, is_const > | inline |
| find_edge(int id) | nuri::Subgraph< NT, ET, is_const > | inline |
| find_edge(typename graph_type::ConstEdgeRef edge) | nuri::Subgraph< NT, ET, is_const > | inline |
| find_edge(int id) const | nuri::Subgraph< NT, ET, is_const > | inline |
| find_edge(typename graph_type::ConstEdgeRef edge) const | nuri::Subgraph< NT, ET, is_const > | inline |
| find_edge(ConstNodeRef src, ConstNodeRef dst) | nuri::Subgraph< NT, ET, is_const > | inline |
| find_edge(ConstNodeRef src, ConstNodeRef dst) const | nuri::Subgraph< NT, ET, is_const > | inline |
| find_edge(typename graph_type::ConstNodeRef src, typename graph_type::ConstNodeRef dst) | nuri::Subgraph< NT, ET, is_const > | inline |
| find_edge(typename graph_type::ConstNodeRef src, typename graph_type::ConstNodeRef dst) const | nuri::Subgraph< NT, ET, is_const > | inline |
| find_node(int id) | nuri::Subgraph< NT, ET, is_const > | inline |
| find_node(typename graph_type::ConstNodeRef node) | nuri::Subgraph< NT, ET, is_const > | inline |
| find_node(int id) const | nuri::Subgraph< NT, ET, is_const > | inline |
| find_node(typename graph_type::ConstNodeRef node) const | nuri::Subgraph< NT, ET, is_const > | inline |
| from_edges(parent_type &graph, internal::IndexSet &&edges) | nuri::Subgraph< NT, ET, is_const > | inlinestatic |
| from_indices(parent_type &graph, internal::IndexSet &&nodes, internal::IndexSet &&edges) | nuri::Subgraph< NT, ET, is_const > | inlinestatic |
| from_nodes(parent_type &graph, internal::IndexSet &&nodes) | nuri::Subgraph< NT, ET, is_const > | inlinestatic |
| graph_type typedef | nuri::Subgraph< NT, ET, is_const > | |
| iterator typedef | nuri::Subgraph< NT, ET, is_const > | |
| node(int idx) | nuri::Subgraph< NT, ET, is_const > | inline |
| node(int idx) const | nuri::Subgraph< NT, ET, is_const > | inline |
| node_begin() | nuri::Subgraph< NT, ET, is_const > | inline |
| node_begin() const | nuri::Subgraph< NT, ET, is_const > | inline |
| node_cbegin() const | nuri::Subgraph< NT, ET, is_const > | inline |
| node_cend() const | nuri::Subgraph< NT, ET, is_const > | inline |
| node_data(int idx) | nuri::Subgraph< NT, ET, is_const > | inline |
| node_data(int idx) const | nuri::Subgraph< NT, ET, is_const > | inline |
| node_data_type typedef | nuri::Subgraph< NT, ET, is_const > | |
| node_end() | nuri::Subgraph< NT, ET, is_const > | inline |
| node_end() const | nuri::Subgraph< NT, ET, is_const > | inline |
| node_ids() const | nuri::Subgraph< NT, ET, is_const > | inline |
| node_iterator typedef | nuri::Subgraph< NT, ET, is_const > | |
| NodeRef typedef | nuri::Subgraph< NT, ET, is_const > | |
| num_edges() const | nuri::Subgraph< NT, ET, is_const > | inline |
| num_nodes() const | nuri::Subgraph< NT, ET, is_const > | inline |
| operator=(const Other< other_const > &other) | nuri::Subgraph< NT, ET, is_const > | inline |
| operator=(Other< other_const > &&other) noexcept | nuri::Subgraph< NT, ET, is_const > | inline |
| operator[](int idx) | nuri::Subgraph< NT, ET, is_const > | inline |
| operator[](int idx) const | nuri::Subgraph< NT, ET, is_const > | inline |
| Other typedef | nuri::Subgraph< NT, ET, is_const > | |
| parent_edge(int idx) | nuri::Subgraph< NT, ET, is_const > | inline |
| parent_edge(int idx) const | nuri::Subgraph< NT, ET, is_const > | inline |
| parent_node(int idx) | nuri::Subgraph< NT, ET, is_const > | inline |
| parent_node(int idx) const | nuri::Subgraph< NT, ET, is_const > | inline |
| parent_type typedef | nuri::Subgraph< NT, ET, is_const > | |
| rebind(parent_type &parent) | nuri::Subgraph< NT, ET, is_const > | inline |
| refresh_edges() | nuri::Subgraph< NT, ET, is_const > | inline |
| remap(const std::vector< int > &node_map, const std::vector< int > &edge_map) | nuri::Subgraph< NT, ET, is_const > | inline |
| remap_edges(const std::vector< int > &old_to_new) | nuri::Subgraph< NT, ET, is_const > | inline |
| remap_nodes(const std::vector< int > &node_map) | nuri::Subgraph< NT, ET, is_const > | inline |
| reserve_edges(int num_edges) | nuri::Subgraph< NT, ET, is_const > | inline |
| reserve_nodes(int num_nodes) | nuri::Subgraph< NT, ET, is_const > | inline |
| size() const | nuri::Subgraph< NT, ET, is_const > | inline |
| Subgraph(graph_type &&graph)=delete | nuri::Subgraph< NT, ET, is_const > | |
| Subgraph(parent_type &graph) | nuri::Subgraph< NT, ET, is_const > | inline |
| Subgraph(const Other< other_const > &other) | nuri::Subgraph< NT, ET, is_const > | inline |
| Subgraph(Other< other_const > &&other) noexcept | nuri::Subgraph< NT, ET, is_const > | inline |
| Subgraph< NT, ET, true > class | nuri::Subgraph< NT, ET, is_const > | friend |
| update(internal::IndexSet &&nodes, internal::IndexSet &&edges) | nuri::Subgraph< NT, ET, is_const > | inline |
| update_edges(internal::IndexSet &&edges) noexcept | nuri::Subgraph< NT, ET, is_const > | inline |
| update_nodes(internal::IndexSet &&nodes) noexcept | nuri::Subgraph< NT, ET, is_const > | inline |
1.17.0