| __disjoint_union(const graph &g) noexcept | lal::graphs::graph | protected |
| _clear() noexcept | lal::graphs::free_tree | inlineprotectedvirtual |
| _init(uint64_t n) noexcept | lal::graphs::free_tree | inlineprotectedvirtual |
| lal::actions_after_add_edge(node u, node v) noexcept | lal::graphs::graph | protectedvirtual |
| lal::graphs::tree::actions_after_add_edge(node u, node v) noexcept | lal::graphs::tree | protectedvirtual |
| lal::actions_after_remove_edge(node u, node v) noexcept | lal::graphs::graph | protectedvirtual |
| lal::graphs::tree::actions_after_remove_edge(node u, node v) noexcept | lal::graphs::tree | protectedvirtual |
| lal::actions_after_remove_node(node u) noexcept | lal::graphs::graph | protectedvirtual |
| lal::graphs::tree::actions_after_remove_node(node u) noexcept | lal::graphs::tree | protectedvirtual |
| lal::actions_before_remove_edges_incident_to(node u) noexcept | lal::graphs::graph | protectedvirtual |
| lal::graphs::tree::actions_before_remove_edges_incident_to(node u) noexcept | lal::graphs::tree | protectedvirtual |
| add_edge(node s, node t, bool norm=true, bool check_norm=true) noexcept | lal::graphs::free_tree | virtual |
| add_edge_bulk(node s, node t) noexcept | lal::graphs::free_tree | |
| add_edges(const std::vector< edge > &edges, bool norm=true, bool check_norm=true) noexcept | lal::graphs::free_tree | virtual |
| are_nodes_in_same_component(node u, node v) const noexcept | lal::graphs::tree | inline |
| calculate_tree_type() noexcept | lal::graphs::free_tree | virtual |
| can_add_edge(node s, node t) const noexcept | lal::graphs::tree | virtual |
| can_add_edges(const std::vector< edge > &edges) const noexcept | lal::graphs::tree | virtual |
| check_normalised() noexcept | lal::graphs::graph | virtual |
| clear() noexcept | lal::graphs::graph | virtual |
| copy_full_free_tree(const free_tree &f) noexcept | lal::graphs::free_tree | inlineprotected |
| copy_full_graph(const graph &g) noexcept | lal::graphs::graph | inlineprotected |
| copy_full_undirected_graph(const undirected_graph &u) noexcept | lal::graphs::undirected_graph | inlineprotected |
| disjoint_union(const free_tree &t) noexcept | lal::graphs::free_tree | |
| disjoint_union(const undirected_graph &g) noexcept | lal::graphs::free_tree | private |
| fill_union_find() noexcept | lal::graphs::tree | inlineprotected |
| finish_bulk_add(bool norm=true, bool check=true) noexcept | lal::graphs::free_tree | virtual |
| free_tree() noexcept | lal::graphs::free_tree | inline |
| free_tree(uint64_t n) noexcept | lal::graphs::free_tree | inline |
| free_tree(const free_tree &t) noexcept | lal::graphs::free_tree | inline |
| free_tree(free_tree &&t) noexcept | lal::graphs::free_tree | inline |
| free_tree(const undirected_graph &t) noexcept | lal::graphs::free_tree | |
| free_tree(undirected_graph &&t) noexcept | lal::graphs::free_tree | |
| get_component_representative(node u) const noexcept | lal::graphs::tree | inline |
| get_degree(node u) const noexcept | lal::graphs::undirected_graph | inline |
| get_edges() const noexcept | lal::graphs::undirected_graph | virtual |
| get_head_vector(node r=0, const linear_arrangement &arr={}) const noexcept | lal::graphs::free_tree | |
| get_neighbours(node u) const noexcept | lal::graphs::undirected_graph | inline |
| get_num_edges() const noexcept | lal::graphs::graph | inline |
| get_num_nodes() const noexcept | lal::graphs::graph | inline |
| get_num_nodes_component(node u) const noexcept | lal::graphs::tree | inline |
| get_Q() const noexcept | lal::graphs::undirected_graph | virtual |
| get_tree_type_list() const noexcept | lal::graphs::tree | |
| graph() noexcept | lal::graphs::graph | inline |
| graph(uint64_t n) noexcept | lal::graphs::graph | inline |
| graph(const graph &g) noexcept | lal::graphs::graph | inline |
| graph(graph &&g) noexcept | lal::graphs::graph | inline |
| has_edge(node u, node v) const noexcept | lal::graphs::undirected_graph | virtual |
| has_node(node u) const noexcept | lal::graphs::graph | inline |
| init(uint64_t n) noexcept | lal::graphs::graph | virtual |
| is_directed() const noexcept | lal::graphs::undirected_graph | inlinevirtual |
| is_normalised() const noexcept | lal::graphs::graph | inline |
| is_of_tree_type(const tree_type &tt) const noexcept | lal::graphs::tree | inline |
| is_rooted() const noexcept | lal::graphs::free_tree | inlinevirtual |
| is_tree() const noexcept | lal::graphs::tree | inline |
| is_tree_type_valid() const noexcept | lal::graphs::tree | inline |
| is_undirected() const noexcept | lal::graphs::undirected_graph | inlinevirtual |
| m_adjacency_list | lal::graphs::graph | protected |
| m_is_tree_type_valid | lal::graphs::tree | protected |
| m_normalised | lal::graphs::graph | protected |
| m_num_edges | lal::graphs::graph | protected |
| m_root_of | lal::graphs::tree | protected |
| m_root_size | lal::graphs::tree | protected |
| m_tree_type | lal::graphs::tree | protected |
| move_full_free_tree(free_tree &&f) noexcept | lal::graphs::free_tree | inlineprotected |
| move_full_graph(graph &&g) noexcept | lal::graphs::graph | inlineprotected |
| move_full_undirected_graph(undirected_graph &&u) noexcept | lal::graphs::undirected_graph | inlineprotected |
| normalise() noexcept | lal::graphs::graph | virtual |
| normalise_after_edge_addition(bool norm, bool check) noexcept | lal::graphs::graph | protected |
| normalise_after_edge_removal(bool norm, bool check) noexcept | lal::graphs::graph | protected |
| operator=(const free_tree &f) noexcept | lal::graphs::free_tree | inline |
| operator=(free_tree &&f) noexcept | lal::graphs::free_tree | inline |
| lal::graphs::undirected_graph::operator=(const undirected_graph &g) noexcept | lal::graphs::undirected_graph | inline |
| lal::graphs::undirected_graph::operator=(undirected_graph &&g) noexcept | lal::graphs::undirected_graph | inline |
| lal::graphs::graph::operator=(const graph &g) noexcept | lal::graphs::graph | inline |
| lal::graphs::graph::operator=(graph &&g) noexcept | lal::graphs::graph | inline |
| lal::graphs::tree::operator=(const tree &t) noexcept | lal::graphs::tree | inline |
| lal::graphs::tree::operator=(tree &&t) noexcept | lal::graphs::tree | inline |
| remove_edge(node s, node t, bool norm=false, bool check_norm=true) noexcept | lal::graphs::free_tree | virtual |
| remove_edges(const std::vector< edge > &edges, bool norm=true, bool check_norm=true) noexcept | lal::graphs::free_tree | virtual |
| remove_edges_incident_to(node u, bool norm=true, bool check_norm=true) noexcept | lal::graphs::free_tree | virtual |
| remove_node(node u, bool norm=true, bool check_norm=true) noexcept | lal::graphs::free_tree | virtual |
| remove_single_edge(node u, node v, neighbourhood &out_u, neighbourhood &in_v) noexcept | lal::graphs::undirected_graph | private |
| set_edges(const std::vector< edge > &edges, bool norm=true, bool check_norm=true) noexcept | lal::graphs::free_tree | virtual |
| set_normalised(bool v=true) noexcept | lal::graphs::graph | inline |
| tree() noexcept | lal::graphs::tree | inline |
| tree(const tree &t) noexcept | lal::graphs::tree | inline |
| tree(tree &&t) noexcept | lal::graphs::tree | inline |
| tree_only_clear() noexcept | lal::graphs::tree | inlineprotected |
| tree_only_copy(const tree &t) noexcept | lal::graphs::tree | inlineprotected |
| tree_only_init(uint64_t n) noexcept | lal::graphs::tree | inlineprotected |
| tree_only_move(tree &&t) noexcept | lal::graphs::tree | inlineprotected |
| tree_only_remove_node(node u) noexcept | lal::graphs::tree | protected |
| tree_only_set_edges() noexcept | lal::graphs::tree | protected |
| undirected_graph() noexcept | lal::graphs::undirected_graph | inline |
| undirected_graph(uint64_t n) noexcept | lal::graphs::undirected_graph | inline |
| undirected_graph(const undirected_graph &g) noexcept | lal::graphs::undirected_graph | inline |
| undirected_graph(undirected_graph &&g) noexcept | lal::graphs::undirected_graph | inline |
| update_union_find_after_edge_add(node u, node v, uint64_t *const root_of, uint64_t *const root_size) noexcept | lal::graphs::free_tree | protectedvirtual |
| update_union_find_after_edge_add(node u, node v, uint64_t *const root_of, uint64_t *const root_size) const noexcept | lal::graphs::free_tree | protectedvirtual |
| update_union_find_after_edge_remove(node u, node v, uint64_t *const root_of, uint64_t *const root_size) noexcept | lal::graphs::free_tree | protectedvirtual |
| update_union_find_after_edge_remove(node u, node v, uint64_t *const root_of, uint64_t *const root_size) const noexcept | lal::graphs::free_tree | protectedvirtual |
| update_union_find_before_incident_edges_removed(node u, uint64_t *const root_of, uint64_t *const root_size) noexcept | lal::graphs::free_tree | protectedvirtual |
| update_union_find_before_incident_edges_removed(node u, uint64_t *const root_of, uint64_t *const root_size) const noexcept | lal::graphs::free_tree | protectedvirtual |
| ~free_tree() noexcept | lal::graphs::free_tree | inlinevirtual |
| ~graph() noexcept | lal::graphs::graph | inlinevirtual |
| ~tree() noexcept | lal::graphs::tree | inlinevirtual |
| ~undirected_graph() noexcept | lal::graphs::undirected_graph | inlinevirtual |
