lal::graphs::free_tree Member List

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

__disjoint_union(const graph &g) noexcept	lal::graphs::graph	protected
_clear() noexcept	lal::graphs::free_tree	protectedvirtual
_init(uint32_t n) noexcept	lal::graphs::free_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
calculate_tree_type() noexcept	lal::graphs::free_tree	virtual
call_union_find_after_add(node u, node v, uint32_t *const root_of, uint32_t *const root_size) noexcept	lal::graphs::free_tree	protectedvirtual
call_union_find_after_add(node u, node v, uint32_t *const root_of, uint32_t *const root_size) const noexcept	lal::graphs::free_tree	protectedvirtual
call_union_find_after_remove(node u, node v, uint32_t *const root_of, uint32_t *const root_size) noexcept	lal::graphs::free_tree	protectedvirtual
call_union_find_after_remove(node u, node v, uint32_t *const root_of, uint32_t *const root_size) const noexcept	lal::graphs::free_tree	protectedvirtual
can_add_edge(node s, node t) const noexcept	lal::graphs::tree
can_add_edges(const std::vector< edge > &edges) const noexcept	lal::graphs::tree
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	protected
copy_full_graph(const graph &g) noexcept	lal::graphs::graph	protected
copy_full_undirected_graph(const undirected_graph &u) noexcept	lal::graphs::undirected_graph	protected
disjoint_union(const free_tree &t) noexcept	lal::graphs::free_tree
disjoint_union(const undirected_graph &g) noexcept	lal::graphs::free_tree	private
extra_work_per_edge_add(node u, node v) noexcept	lal::graphs::tree	protectedvirtual
extra_work_per_edge_remove(node u, node v) noexcept	lal::graphs::tree	protectedvirtual
fill_union_find() noexcept	lal::graphs::tree	protected
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(uint32_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_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 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
lal::graphs::undirected_graph::graph(uint32_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(node u, node v) const noexcept	lal::graphs::undirected_graph	virtual
has_node(node u) const noexcept	lal::graphs::graph	inline
init(uint32_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	protected
move_full_graph(graph &&g) noexcept	lal::graphs::graph	protected
move_full_undirected_graph(undirected_graph &&u) noexcept	lal::graphs::undirected_graph	protected
normalise() noexcept	lal::graphs::graph	virtual
normalise_after_add(bool norm, bool check) noexcept	lal::graphs::graph	protected
normalise_after_remove(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::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(node s, node t, bool norm=false, bool check_norm=true) noexcept	lal::graphs::undirected_graph	virtual
remove_edges(const std::vector< edge > &edges, bool norm=true, bool check_norm=true) noexcept	lal::graphs::undirected_graph	virtual
remove_edges_incident_to(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	protected
tree_only_copy(const tree &t) noexcept	lal::graphs::tree	protected
tree_only_extra_work_edges_set() noexcept	lal::graphs::tree	protected
tree_only_init(uint32_t n) noexcept	lal::graphs::tree	protected
tree_only_move(tree &&t) noexcept	lal::graphs::tree	protected
undirected_graph() noexcept	lal::graphs::undirected_graph	inline
undirected_graph(uint32_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
~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