lal::graphs::directed_graph Member List

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

__disjoint_union(const graph &g) noexcept	lal::graphs::graph	protected
_clear() noexcept	lal::graphs::directed_graph	protectedvirtual
_init(uint32_t n) noexcept	lal::graphs::directed_graph	protectedvirtual
add_edge(node s, node t, bool norm=true, bool check_norm=true) noexcept	lal::graphs::directed_graph	virtual
add_edge_bulk(node s, node t) noexcept	lal::graphs::directed_graph
add_edges(const std::vector< edge > &edges, bool norm=true, bool check_norm=true) noexcept	lal::graphs::directed_graph	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	protected
copy_full_graph(const graph &g) noexcept	lal::graphs::graph	protected
directed_graph() noexcept	lal::graphs::directed_graph	inline
directed_graph(uint32_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 directed_graph &g) noexcept	lal::graphs::directed_graph
extra_work_per_edge_add(node u, node v) noexcept	lal::graphs::graph	protectedvirtual
extra_work_per_edge_remove(node u, node v) noexcept	lal::graphs::graph	protectedvirtual
finish_bulk_add(bool norm=true, bool check=true) noexcept	lal::graphs::directed_graph	virtual
get_degree(node u) const noexcept	lal::graphs::directed_graph	inline
get_edges() const noexcept	lal::graphs::directed_graph	virtual
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_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
graph() noexcept	lal::graphs::graph	inline
graph(uint32_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
init(uint32_t n) noexcept	lal::graphs::graph	virtual
is_directed() const noexcept	lal::graphs::directed_graph	inlinevirtual
is_normalised() const noexcept	lal::graphs::graph	inline
is_undirected() const noexcept	lal::graphs::directed_graph	inlinevirtual
m_adjacency_list	lal::graphs::graph	protected
m_in_adjacency_list	lal::graphs::directed_graph	protected
m_normalised	lal::graphs::graph	protected
m_num_edges	lal::graphs::graph	protected
move_full_directed_graph(directed_graph &&d) noexcept	lal::graphs::directed_graph	protected
move_full_graph(graph &&g) noexcept	lal::graphs::graph	protected
normalise() noexcept	lal::graphs::directed_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 directed_graph &g) noexcept	lal::graphs::directed_graph	inline
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
remove_edge(node s, node t, bool norm=false, bool check_norm=true) noexcept	lal::graphs::directed_graph	virtual
remove_edges(const std::vector< edge > &edges, bool norm=true, bool check_norm=true) noexcept	lal::graphs::directed_graph	virtual
remove_edges_incident_to(node u, bool norm=true, bool check_norm=true) noexcept	lal::graphs::directed_graph	virtual
remove_single_edge(node u, node v, neighbourhood &out_u, neighbourhood &in_v) noexcept	lal::graphs::directed_graph	private
set_edges(const std::vector< edge > &edges, bool norm=true, bool check_norm=true) noexcept	lal::graphs::directed_graph	virtual
set_normalised(bool v=true) noexcept	lal::graphs::graph	inline
to_undirected(bool norm=true, bool check=true) const noexcept	lal::graphs::directed_graph
~directed_graph() noexcept	lal::graphs::directed_graph	inlinevirtual
~graph() noexcept	lal::graphs::graph	inlinevirtual