lal::graphs::rooted_tree Member List

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

__disjoint_union(const graph &g) noexcept	lal::graphs::graph	protected
_clear() noexcept	lal::graphs::rooted_tree	inlineprotectedvirtual
_init(uint64_t n) noexcept	lal::graphs::rooted_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::rooted_tree	virtual
add_edge_bulk(node s, node t) noexcept	lal::graphs::rooted_tree
add_edges(const std::vector< edge > &edges, bool norm=true, bool check_norm=true) noexcept	lal::graphs::rooted_tree	virtual
are_nodes_in_same_component(node u, node v) const noexcept	lal::graphs::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(node s, 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_normalised() 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(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, bool connect_roots=true) noexcept	lal::graphs::rooted_tree
disjoint_union(const directed_graph &g) noexcept	lal::graphs::rooted_tree	private
fill_union_find() noexcept	lal::graphs::tree	inlineprotected
finish_bulk_add(bool norm=true, bool check=true) noexcept	lal::graphs::rooted_tree	virtual
get_component_representative(node u) const noexcept	lal::graphs::tree	inline
get_degree(node u) const noexcept	lal::graphs::directed_graph	inline
get_edges() const noexcept	lal::graphs::directed_graph	virtual
get_edges_subtree(node u, 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(node u) const noexcept	lal::graphs::directed_graph	inline
get_in_neighbours(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(node u) const noexcept	lal::graphs::tree	inline
get_num_nodes_subtree(node u) const noexcept	lal::graphs::rooted_tree	inline
get_out_degree(node u) const noexcept	lal::graphs::directed_graph	inline
get_out_neighbours(node u) const noexcept	lal::graphs::directed_graph	inline
get_Q() const noexcept	lal::graphs::directed_graph	virtual
get_root() const noexcept	lal::graphs::rooted_tree	inline
get_subtree(node u) const noexcept	lal::graphs::rooted_tree
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::directed_graph	virtual
has_node(node u) const noexcept	lal::graphs::graph	inline
has_root() const noexcept	lal::graphs::rooted_tree	inline
init(uint64_t n) noexcept	lal::graphs::graph	virtual
init_rooted(const free_tree &t, node r) noexcept	lal::graphs::rooted_tree
is_directed() const noexcept	lal::graphs::directed_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_root_valid(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_has_root	lal::graphs::rooted_tree	protected
m_in_adjacency_list	lal::graphs::directed_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	lal::graphs::rooted_tree	protected
m_root_of	lal::graphs::tree	protected
m_root_size	lal::graphs::tree	protected
m_size_subtrees	lal::graphs::rooted_tree	protected
m_tree_type	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
normalise() noexcept	lal::graphs::directed_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 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::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::rooted_tree	virtual
remove_edges(const std::vector< edge > &edges, bool norm=true, bool check_norm=true) noexcept	lal::graphs::rooted_tree	virtual
remove_edges_incident_to(node u, bool norm=true, bool check_norm=true) noexcept	lal::graphs::rooted_tree	virtual
remove_node(node u, bool connect=false, bool norm=true, bool check_norm=true) noexcept	lal::graphs::rooted_tree
remove_node(node u, bool norm=true, bool check_norm=true) noexcept	lal::graphs::rooted_tree	privatevirtual
remove_single_edge(node u, node v, neighbourhood &out_u, neighbourhood &in_v) noexcept	lal::graphs::directed_graph	private
rooted_tree() noexcept	lal::graphs::rooted_tree	inline
rooted_tree(uint64_t n) noexcept	lal::graphs::rooted_tree	inline
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, node r) noexcept	lal::graphs::rooted_tree	inline
set_edges(const std::vector< edge > &edges, bool norm=true, bool check_norm=true) noexcept	lal::graphs::rooted_tree	virtual
set_normalised(bool v=true) noexcept	lal::graphs::graph	inline
set_root(node r) noexcept	lal::graphs::rooted_tree	inline
subtree_contains_node(node r, node u) const noexcept	lal::graphs::rooted_tree
to_free_tree(bool norm=true, bool check=true) const noexcept	lal::graphs::rooted_tree
to_undirected(bool norm=true, 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_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
update_union_find_after_edge_add(node u, node v, uint64_t *const root_of, uint64_t *const root_size) noexcept	lal::graphs::rooted_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::rooted_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::rooted_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::rooted_tree	protectedvirtual
update_union_find_before_incident_edges_removed(node u, uint64_t *const root_of, uint64_t *const root_size) noexcept	lal::graphs::rooted_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::rooted_tree	protectedvirtual
~directed_graph() noexcept	lal::graphs::directed_graph	inlinevirtual
~graph() noexcept	lal::graphs::graph	inlinevirtual
~rooted_tree() noexcept	lal::graphs::rooted_tree	inlinevirtual
~tree() noexcept	lal::graphs::tree	inlinevirtual