lal::graphs::graph Member List

This is the complete list of members for lal::graphs::graph, 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::graph	inlineprotectedvirtual
_init(const uint64_t n) noexcept	lal::graphs::graph	inlineprotectedvirtual
actions_after_add_edge(const node u, const node v) noexcept	lal::graphs::graph	protectedvirtual
actions_after_add_edges(const edge_list &e) noexcept	lal::graphs::graph	protectedvirtual
actions_after_add_edges_bulk() noexcept	lal::graphs::graph	protectedvirtual
actions_after_remove_edge(const node u, const node v) noexcept	lal::graphs::graph	protectedvirtual
actions_after_remove_edges(const edge_list &e) noexcept	lal::graphs::graph	protectedvirtual
actions_after_remove_edges_bulk() noexcept	lal::graphs::graph	protectedvirtual
actions_after_remove_node(const node u) noexcept	lal::graphs::graph	protectedvirtual
actions_before_remove_edges_incident_to(const node u) noexcept	lal::graphs::graph	protectedvirtual
check_normalized() noexcept	lal::graphs::graph	virtual
clear() noexcept	lal::graphs::graph	virtual
copy_full_graph(const graph &g) noexcept	lal::graphs::graph	inlineprotected
finish_bulk_add(const bool norm=true, const bool check=true) noexcept=0	lal::graphs::graph	pure virtual
finish_bulk_remove(const bool norm=true, const bool check=true) noexcept=0	lal::graphs::graph	pure virtual
get_edges() const noexcept=0	lal::graphs::graph	pure virtual
get_num_edges() const noexcept	lal::graphs::graph	inline
get_num_nodes() const noexcept	lal::graphs::graph	inline
get_Q() const noexcept=0	lal::graphs::graph	pure virtual
graph() noexcept	lal::graphs::graph	inline
graph(const 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(const node u, const node v) const =0	lal::graphs::graph	pure 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=0	lal::graphs::graph	pure virtual
is_normalized() const noexcept	lal::graphs::graph	inline
is_undirected() const noexcept=0	lal::graphs::graph	pure virtual
m_adjacency_list	lal::graphs::graph	protected
m_is_normalized	lal::graphs::graph	protected
m_num_edges	lal::graphs::graph	protected
move_full_graph(graph &&g) noexcept	lal::graphs::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 graph &g) noexcept	lal::graphs::graph	inline
operator=(graph &&g) noexcept	lal::graphs::graph	inline
set_normalized(const bool v=true) noexcept	lal::graphs::graph	inline
~graph() noexcept	lal::graphs::graph	inlinevirtual