lal::graphs::rooted_tree Member List

This is the complete list of members for lal::graphs::rooted_tree, including all inherited members.

__add_node() noexcept	lal::graphs::graph	inlineprotected
__disjoint_union(const graph &g) noexcept	lal::graphs::graph	protected
_clear() noexcept	lal::graphs::rooted_tree	inlineprotectedvirtual
_init(const uint64_t n) noexcept	lal::graphs::rooted_tree	inlineprotectedvirtual
actions_after_add_edge(const node u, const node v) noexcept	lal::graphs::rooted_tree	protectedvirtual
actions_after_add_edges(const edge_list &e) noexcept	lal::graphs::rooted_tree	protectedvirtual
actions_after_add_edges_bulk() noexcept	lal::graphs::rooted_tree	protectedvirtual
actions_after_remove_edge(const node u, const node v) noexcept	lal::graphs::rooted_tree	protectedvirtual
actions_after_remove_edges(const edge_list &e) noexcept	lal::graphs::rooted_tree	protectedvirtual
actions_after_remove_edges_bulk() noexcept	lal::graphs::rooted_tree	protectedvirtual
actions_after_remove_node(const node u) noexcept	lal::graphs::rooted_tree	protectedvirtual
actions_before_remove_edges_incident_to(const node u) noexcept	lal::graphs::rooted_tree	protectedvirtual
add_edge(const node s, const node t, const bool norm=true, const bool check_norm=true) noexcept	lal::graphs::rooted_tree	virtual
add_edge_bulk(const node s, const node t) noexcept	lal::graphs::rooted_tree
add_edges(const std::vector< edge > &edges, const bool norm=true, const bool check_norm=true) noexcept	lal::graphs::rooted_tree	virtual
add_node() noexcept	lal::graphs::rooted_tree	inlinevirtual
are_nodes_in_same_component(const node u, const node v) const noexcept	lal::graphs::tree	inline
are_nodes_siblings(const node u, const node v) const noexcept	lal::graphs::rooted_tree	inline
are_size_subtrees_valid() const noexcept	lal::graphs::rooted_tree	inline
calculate_size_subtrees() noexcept	lal::graphs::rooted_tree
calculate_tree_type() noexcept	lal::graphs::rooted_tree	virtual
can_add_edge(const node s, const node t) const noexcept	lal::graphs::rooted_tree	virtual
can_add_edges(const std::vector< edge > &edges) const noexcept	lal::graphs::rooted_tree	virtual
check_normalized() noexcept	lal::graphs::directed_graph	virtual
clear() noexcept	lal::graphs::graph	virtual
copy_full_directed_graph(const directed_graph &d) noexcept	lal::graphs::directed_graph	inlineprotected
copy_full_graph(const graph &g) noexcept	lal::graphs::graph	inlineprotected
copy_full_rooted_tree(const rooted_tree &r) noexcept	lal::graphs::rooted_tree	inlineprotected
directed_graph() noexcept	lal::graphs::directed_graph	inline
directed_graph(const uint64_t n) noexcept	lal::graphs::directed_graph	inline
directed_graph(const directed_graph &g) noexcept	lal::graphs::directed_graph	inline
directed_graph(directed_graph &&g) noexcept	lal::graphs::directed_graph	inline
disjoint_union(const rooted_tree &t, const bool connect_roots=true) noexcept	lal::graphs::rooted_tree
disjoint_union(const directed_graph &g) noexcept	lal::graphs::rooted_tree	private
empty_union_find() noexcept	lal::graphs::tree	inlineprotected
fill_union_find() noexcept	lal::graphs::tree	inlineprotected
finish_bulk_add(const bool norm=true, const bool check=true) noexcept	lal::graphs::rooted_tree	virtual
finish_bulk_add_complete(const bool norm=true, const bool check=true) noexcept	lal::graphs::rooted_tree	virtual
finish_bulk_remove(const bool norm=true, const bool check=true) noexcept	lal::graphs::rooted_tree	virtual
finish_bulk_remove_complete(const bool norm=true, const bool check=true) noexcept	lal::graphs::rooted_tree	virtual
get_component_representative(const node u) const noexcept	lal::graphs::tree	inline
get_connected_components() const noexcept	lal::graphs::directed_graph
get_degree(const node u) const noexcept	lal::graphs::directed_graph	inline
get_edges() const noexcept	lal::graphs::directed_graph	virtual
get_edges_subtree(const node u, const bool relab=false) const noexcept	lal::graphs::rooted_tree
get_head_vector(const linear_arrangement &arr={}) const noexcept	lal::graphs::rooted_tree
get_in_degree(const node u) const noexcept	lal::graphs::directed_graph	inline
get_in_neighbors(const node u) const noexcept	lal::graphs::directed_graph	inline
get_num_edges() const noexcept	lal::graphs::graph	inline
get_num_nodes() const noexcept	lal::graphs::graph	inline
get_num_nodes_component(const node u) const noexcept	lal::graphs::tree	inline
get_num_nodes_subtree(const node u) const noexcept	lal::graphs::rooted_tree	inline
get_out_degree(const node u) const noexcept	lal::graphs::directed_graph	inline
get_out_neighbors(const node u) const noexcept	lal::graphs::directed_graph	inline
get_parent_node(const node u) const noexcept	lal::graphs::rooted_tree	inline
get_Q() const noexcept	lal::graphs::directed_graph	virtual
get_root() const noexcept	lal::graphs::rooted_tree	inline
get_subtree(const node u) const noexcept	lal::graphs::rooted_tree
get_tree_type_list() const noexcept	lal::graphs::tree
graph() noexcept	lal::graphs::graph	inline
lal::graphs::directed_graph::graph(const uint64_t n) noexcept	lal::graphs::graph	inline
lal::graphs::directed_graph::graph(const graph &g) noexcept	lal::graphs::graph	inline
lal::graphs::directed_graph::graph(graph &&g) noexcept	lal::graphs::graph	inline
has_edge(const node u, const node v) const noexcept	lal::graphs::directed_graph	virtual
has_node(const node u) const noexcept	lal::graphs::graph	inline
has_root() const noexcept	lal::graphs::rooted_tree	inline
init(const uint64_t n) noexcept	lal::graphs::graph	virtual
init_rooted(const free_tree &t, const node r, const bool norm=true, const bool check_norm=true) noexcept	lal::graphs::rooted_tree
init_rooted(free_tree &&t, const node r, const bool norm=true, const bool check_norm=true) noexcept	lal::graphs::rooted_tree
is_directed() const noexcept	lal::graphs::directed_graph	inlinevirtual
is_normalized() const noexcept	lal::graphs::graph	inline
is_of_tree_type(const tree_type &tt) const noexcept	lal::graphs::tree	inline
is_root_valid(const node r) const noexcept	lal::graphs::rooted_tree	inline
is_rooted() const noexcept	lal::graphs::rooted_tree	inlinevirtual
is_rooted_tree() const noexcept	lal::graphs::rooted_tree	inline
is_tree() const noexcept	lal::graphs::tree	inline
is_tree_type_valid() const noexcept	lal::graphs::tree	inline
is_undirected() const noexcept	lal::graphs::directed_graph	inlinevirtual
m_adjacency_list	lal::graphs::graph	protected
m_are_size_subtrees_valid	lal::graphs::rooted_tree	protected
m_in_adjacency_list	lal::graphs::directed_graph	protected
m_is_normalized	lal::graphs::graph	protected
m_is_tree_type_valid	lal::graphs::tree	protected
m_num_edges	lal::graphs::graph	protected
m_root	lal::graphs::rooted_tree	protected
m_size_subtrees	lal::graphs::rooted_tree	protected
m_tree_type	lal::graphs::tree	protected
m_union_find__root_of	lal::graphs::tree	protected
m_union_find__root_size	lal::graphs::tree	protected
move_full_directed_graph(directed_graph &&d) noexcept	lal::graphs::directed_graph	inlineprotected
move_full_graph(graph &&g) noexcept	lal::graphs::graph	inlineprotected
move_full_rooted_tree(rooted_tree &&r) noexcept	lal::graphs::rooted_tree	inlineprotected
node_has_parent(const node u) const noexcept	lal::graphs::rooted_tree	inline
normalize() noexcept	lal::graphs::directed_graph	virtual
normalize_after_edge_addition(const bool norm, const bool check) noexcept	lal::graphs::graph	protected
normalize_after_edge_removal(const bool norm, const bool check) noexcept	lal::graphs::graph	protected
operator=(const rooted_tree &r) noexcept	lal::graphs::rooted_tree	inline
operator=(rooted_tree &&r) noexcept	lal::graphs::rooted_tree	inline
lal::graphs::directed_graph::operator=(const directed_graph &g) noexcept	lal::graphs::directed_graph	inline
lal::graphs::directed_graph::operator=(directed_graph &&g) noexcept	lal::graphs::directed_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
lal::graphs::graph::operator=(const graph &g) noexcept	lal::graphs::graph	inline
lal::graphs::graph::operator=(graph &&g) noexcept	lal::graphs::graph	inline
remove_edge(const node s, const node t, const bool norm=false, const bool check_norm=true) noexcept	lal::graphs::rooted_tree	virtual
remove_edge_bulk(const node s, const node t) noexcept	lal::graphs::rooted_tree	virtual
remove_edges(const std::vector< edge > &edges, const bool norm=true, const bool check_norm=true) noexcept	lal::graphs::rooted_tree	virtual
remove_edges_incident_to(const node u, const bool norm=true, const bool check_norm=true) noexcept	lal::graphs::rooted_tree	virtual
remove_node(const node u, const bool connect=false, const bool norm=true, const bool check_norm=true) noexcept	lal::graphs::rooted_tree
remove_node(const node u, const bool norm=true, const bool check_norm=true) noexcept	lal::graphs::rooted_tree	privatevirtual
remove_single_edge(const node u, const node v, neighbourhood &out_u, neighbourhood &in_v) noexcept	lal::graphs::directed_graph	private
reserve_in_degree(const node u, const uint64_t d) noexcept	lal::graphs::directed_graph	inline
reserve_out_degree(const node u, const uint64_t d) noexcept	lal::graphs::directed_graph	inline
rooted_tree() noexcept	lal::graphs::rooted_tree	inline
rooted_tree(const uint64_t n) noexcept	lal::graphs::rooted_tree	inline
rooted_tree(const directed_graph &t) noexcept	lal::graphs::rooted_tree
rooted_tree(directed_graph &&t) noexcept	lal::graphs::rooted_tree
rooted_tree(const rooted_tree &r) noexcept	lal::graphs::rooted_tree	inline
rooted_tree(rooted_tree &&r) noexcept	lal::graphs::rooted_tree	inline
rooted_tree(const free_tree &t, const node r, const bool norm=true, const bool check_norm=true) noexcept	lal::graphs::rooted_tree	inline
rooted_tree(free_tree &&t, const node r, const bool norm=true, const bool check_norm=true) noexcept	lal::graphs::rooted_tree	inline
set_edges(const std::vector< edge > &edges, const bool norm=true, const bool check_norm=true) noexcept	lal::graphs::rooted_tree	virtual
set_normalized(const bool v=true) noexcept	lal::graphs::graph	inline
set_root(const node r) noexcept	lal::graphs::rooted_tree	inline
subtree_contains_node(const node r, const node u) const noexcept	lal::graphs::rooted_tree
to_free_tree(const bool norm=true, const bool check=true) const noexcept	lal::graphs::rooted_tree
to_undirected(const bool norm=true, const bool check=true) const noexcept	lal::graphs::directed_graph
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_actions_after_add_edge(const node u, const node v) noexcept	lal::graphs::tree	protected
tree_only_actions_after_add_edges(const edge_list &e) noexcept	lal::graphs::tree	protected
tree_only_actions_after_add_edges_bulk() noexcept	lal::graphs::tree	protected
tree_only_actions_after_add_edges_bulk_complete() noexcept	lal::graphs::tree	protected
tree_only_actions_after_remove_edge(const node u, const node v) noexcept	lal::graphs::tree	protected
tree_only_actions_after_remove_edges(const edge_list &e) noexcept	lal::graphs::tree	protected
tree_only_actions_after_remove_edges_bulk() noexcept	lal::graphs::tree	protected
tree_only_actions_after_remove_edges_bulk_complete() noexcept	lal::graphs::tree	protected
tree_only_actions_after_remove_node(const node u) noexcept	lal::graphs::tree	protected
tree_only_actions_before_remove_edges_incident_to(const node u) noexcept	lal::graphs::tree	protected
tree_only_add_node() noexcept	lal::graphs::tree	inlineprotected
tree_only_clear() noexcept	lal::graphs::tree	inlineprotected
tree_only_copy(const tree &t) noexcept	lal::graphs::tree	inlineprotected
tree_only_init(const uint64_t n) noexcept	lal::graphs::tree	inlineprotected
tree_only_invalidate() noexcept	lal::graphs::tree	inlineprotected
tree_only_move(tree &&t) noexcept	lal::graphs::tree	inlineprotected
tree_only_remove_node(const node u) noexcept	lal::graphs::tree	protected
tree_only_set_edges() noexcept	lal::graphs::tree	protected
update_union_find_after_add_edge(const node u, const node v, uint64_t *const root_of, uint64_t *const root_size) const noexcept	lal::graphs::rooted_tree	protectedvirtual
update_union_find_after_add_edges(const edge_list &edges, uint64_t *const root_of, uint64_t *const root_size) const noexcept	lal::graphs::rooted_tree	protectedvirtual
update_union_find_after_add_edges_bulk(uint64_t *const root_of, uint64_t *const root_size) const noexcept	lal::graphs::rooted_tree	protectedvirtual
update_union_find_after_remove_edge(const node u, const node v, uint64_t *const root_of, uint64_t *const root_size) const noexcept	lal::graphs::rooted_tree	protectedvirtual
update_union_find_after_remove_edges(const edge_list &edges, uint64_t *const root_of, uint64_t *const root_size) const noexcept	lal::graphs::rooted_tree	protectedvirtual
update_union_find_after_remove_edges_bulk(uint64_t *const root_of, uint64_t *const root_size) const noexcept	lal::graphs::rooted_tree	protectedvirtual
update_union_find_before_remove_incident_edges_to(const node u, uint64_t *const root_of, uint64_t *const root_size) const noexcept	lal::graphs::rooted_tree	protectedvirtual
~directed_graph() noexcept	lal::graphs::directed_graph	inlinevirtual
~graph() noexcept	lal::graphs::graph	inlinevirtual
~rooted_tree() noexcept	lal::graphs::rooted_tree	inline
~tree() noexcept	lal::graphs::tree	inlinevirtual