lal::graphs::free_tree Member List

This is the complete list of members for lal::graphs::free_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::free_tree	inlineprotectedvirtual
_init(const uint64_t n) noexcept	lal::graphs::free_tree	inlineprotectedvirtual
actions_after_add_edge(const node u, const node v) noexcept	lal::graphs::free_tree	protectedvirtual
actions_after_add_edges(const edge_list &e) noexcept	lal::graphs::free_tree	protectedvirtual
actions_after_add_edges_bulk() noexcept	lal::graphs::free_tree	protectedvirtual
actions_after_remove_edge(const node u, const node v) noexcept	lal::graphs::free_tree	protectedvirtual
actions_after_remove_edges(const edge_list &e) noexcept	lal::graphs::free_tree	protectedvirtual
actions_after_remove_edges_bulk() noexcept	lal::graphs::free_tree	protectedvirtual
actions_after_remove_node(const node u) noexcept	lal::graphs::free_tree	protectedvirtual
actions_before_remove_edges_incident_to(const node u) noexcept	lal::graphs::free_tree	protectedvirtual
add_edge(const node s, const node t, const bool norm=true, const bool check_norm=true) noexcept	lal::graphs::free_tree	virtual
add_edge_bulk(const node s, const node t) noexcept	lal::graphs::free_tree
add_edges(const std::vector< edge > &edges, const bool norm=true, const bool check_norm=true) noexcept	lal::graphs::free_tree	virtual
add_node() noexcept	lal::graphs::free_tree	inlinevirtual
are_nodes_in_same_component(const node u, const node v) const noexcept	lal::graphs::tree	inline
calculate_tree_type() noexcept	lal::graphs::free_tree	virtual
can_add_edge(node const s, const node t) const noexcept	lal::graphs::tree	virtual
can_add_edges(const std::vector< edge > &edges) const noexcept	lal::graphs::tree	virtual
check_normalized() 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
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::free_tree	virtual
finish_bulk_add_complete(const bool norm=true, const bool check=true) noexcept	lal::graphs::free_tree	virtual
finish_bulk_remove(const bool norm=true, const bool check=true) noexcept	lal::graphs::free_tree	virtual
finish_bulk_remove_complete(const bool norm=true, const bool check=true) noexcept	lal::graphs::free_tree	virtual
free_tree() noexcept	lal::graphs::free_tree	inline
free_tree(const 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(const node u) const noexcept	lal::graphs::tree	inline
get_connected_components() const noexcept	lal::graphs::undirected_graph
get_degree(const node u) const noexcept	lal::graphs::undirected_graph	inline
get_edges() const noexcept	lal::graphs::undirected_graph	virtual
get_head_vector(const node r=0, const linear_arrangement &arr={}) const noexcept	lal::graphs::free_tree
get_neighbors(const 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(const 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
lal::graphs::undirected_graph::graph(const uint64_t n) noexcept	lal::graphs::graph	inline
lal::graphs::undirected_graph::graph(const graph &g) noexcept	lal::graphs::graph	inline
lal::graphs::undirected_graph::graph(graph &&g) noexcept	lal::graphs::graph	inline
has_edge(const node u, const node v) const noexcept	lal::graphs::undirected_graph	virtual
has_node(const node u) const noexcept	lal::graphs::graph	inline
init(const uint64_t n) noexcept	lal::graphs::graph	virtual
is_directed() const noexcept	lal::graphs::undirected_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_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_normalized	lal::graphs::graph	protected
m_is_tree_type_valid	lal::graphs::tree	protected
m_num_edges	lal::graphs::graph	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_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
normalize() noexcept	lal::graphs::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 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::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::free_tree	virtual
remove_edge_bulk(const node s, const node t) noexcept	lal::graphs::free_tree	virtual
remove_edges(const std::vector< edge > &edges, const bool norm=true, const bool check_norm=true) noexcept	lal::graphs::free_tree	virtual
remove_edges_incident_to(const node u, const bool norm=true, const bool check_norm=true) noexcept	lal::graphs::free_tree	virtual
remove_node(const node u, const bool norm=true, const bool check_norm=true) noexcept	lal::graphs::free_tree	virtual
remove_single_edge(const node u, const node v, neighbourhood &out_u, neighbourhood &in_v) noexcept	lal::graphs::undirected_graph	private
reserve_degree(const node u, const uint64_t d) noexcept	lal::graphs::undirected_graph	inline
rooted_tree class	lal::graphs::free_tree	friend
set_edges(const std::vector< edge > &edges, const bool norm=true, const bool check_norm=true) noexcept	lal::graphs::free_tree	virtual
set_normalized(const 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_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
undirected_graph() noexcept	lal::graphs::undirected_graph	inline
undirected_graph(const 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_add_edge(const node u, const node v, uint64_t *const root_of, uint64_t *const root_size) const noexcept	lal::graphs::free_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::free_tree	protectedvirtual
update_union_find_after_add_edges_bulk(uint64_t *const root_of, uint64_t *const root_size) const noexcept	lal::graphs::free_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::free_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::free_tree	protectedvirtual
update_union_find_after_remove_edges_bulk(uint64_t *const root_of, uint64_t *const root_size) const noexcept	lal::graphs::free_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::free_tree	protectedvirtual
~free_tree() noexcept	lal::graphs::free_tree	inline
~graph() noexcept	lal::graphs::graph	inlinevirtual
~tree() noexcept	lal::graphs::tree	inlinevirtual
~undirected_graph() noexcept	lal::graphs::undirected_graph	inlinevirtual