#include <graph.H>

Inheritance diagram for Designar::Digraph< NodeInfo, ArcInfo, GraphInfo >:

Collaboration diagram for Designar::Digraph< NodeInfo, ArcInfo, GraphInfo >:

Classes
class	AdjacentArcIterator

class	ArcIterator

class	NodeIterator

Public Types
using	NodeInfoType = NodeInfo

using	ArcInfoType = ArcInfo

using	GraphInfoType = GraphInfo

using	SetSizeType = nat_t

using	Node = DigraphNode< NodeInfo, ArcInfo, GraphInfo >

using	Arc = DigraphArc< Node, NodeInfo, ArcInfo, GraphInfo >

Public Member Functions
	Digraph ()

	Digraph (const GraphInfo &_info)

	Digraph (GraphInfo &&_info)

	Digraph (const Digraph &g)

	Digraph (Digraph &&g)

	~Digraph ()

Digraph &	operator= (const Digraph &g)

Digraph &	operator= (Digraph &&g)

void	swap (Digraph &g)

void	clear ()

GraphInfo &	get_info ()

const GraphInfo &	get_info () const

Node *	get_first_node ()

Node *	get_first_node () const

Arc *	get_first_arc ()

Arc *	get_first_arc () const

nat_t	get_num_nodes () const

nat_t	get_num_arcs () const

Node *	insert_node ()

Node *	insert_node (const NodeInfo &info)

Node *	insert_node (NodeInfo &&info)

Arc *	insert_arc (Node s, Node t)

Arc *	insert_arc (Node src, Node tgt, const ArcInfo &info)

Arc *	insert_arc (Node src, Node tgt, ArcInfo &&info)

void	remove_arc (Arc *a)

void	remove_node (Node *n)

NodeIterator	nodes_begin ()

const NodeIterator	nodes_begin () const

NodeIterator	nodes_end ()

const NodeIterator	nodes_end () const

ArcIterator	arcs_begin ()

const ArcIterator	arcs_begin () const

ArcIterator	arcs_end ()

const ArcIterator	arcs_end () const

AdjacentArcIterator	arcs_begin (Node *p)

const AdjacentArcIterator	arcs_begin (Node *p) const

AdjacentArcIterator	arcs_end (Node *p)

const AdjacentArcIterator	arcs_end (Node *p) const

Arc *	search_arc (Node , Node )

template<class Cmp >
void	sort_nodes (Cmp &cmp)

template<class Cmp >
void	sort_nodes (Cmp &&cmp=Cmp())

template<class Cmp >
void	sort_arcs (Cmp &cmp)

template<class Cmp >
void	sort_arcs (Cmp &&cmp=Cmp())

bool	is_digraph () const

Public Member Functions inherited from Designar::BaseGraph< Digraph< NodeInfo, ArcInfo, GraphInfo >, DigraphNode< NodeInfo, ArcInfo, GraphInfo >, DigraphArc< DigraphNode< NodeInfo, ArcInfo, GraphInfo >, NodeInfo, ArcInfo, GraphInfo >, NodeInfo, ArcInfo >
DigraphNode< NodeInfo, ArcInfo, GraphInfo > *	nth_node (nat_t i)

DigraphNode< NodeInfo, ArcInfo, GraphInfo > *	nth_node (nat_t i) const

void	for_each_node (Op &op) const

void	for_each_node (Op &&op=Op()) const

ContainerRet	filter_nodes (Pred &pred) const

ContainerRet	filter_nodes (Pred &&pred=Pred()) const

ContainerRet	map_nodes (Op &op) const

ContainerRet	map_nodes (Op &&op=Op()) const

ContainerRet	map_nodes_if (Op &op, Pred &pred) const

ContainerRet	map_nodes_if (Op &op, Pred &&pred=Pred()) const

ContainerRet	map_nodes_if (Op &&op, Pred &pred) const

ContainerRet	map_nodes_if (Op &&op=Op(), Pred &&pred=Pred()) const

RetT	fold_nodes (const RetT &init_val, Op &op) const

RetT	fold_nodes (const RetT &init_val, Op &&op=Op()) const

RetT	fold_nodes (RetT &&init_val, Op &op) const

RetT	fold_nodes (RetT &&init_val, Op &&op=Op()) const

bool	all_nodes (Pred &pred) const

bool	all_nodes (Pred &&pred=Pred()) const

bool	exists_node (Pred &pred) const

bool	exists_node (Pred &&pred=Pred()) const

bool	none_node (Pred &pred) const

bool	none_node (Pred &&pred=Pred()) const

DigraphNode< NodeInfo, ArcInfo, GraphInfo > *	search_node (Pred &pred) const

DigraphNode< NodeInfo, ArcInfo, GraphInfo > *	search_node (Pred &&pred=Pred()) const

bool	remove_first_node_if (Pred &pred)

bool	remove_first_node_if (Pred &&pred=Pred())

void	remove_node_if (Pred &pred)

void	remove_node_if (Pred &&pred=Pred())

SLList< DigraphNode< NodeInfo, ArcInfo, GraphInfo > * >	nodes () const

DigraphArc< DigraphNode< NodeInfo, ArcInfo, GraphInfo >, NodeInfo, ArcInfo, GraphInfo > *	nth_arc (nat_t i)

DigraphArc< DigraphNode< NodeInfo, ArcInfo, GraphInfo >, NodeInfo, ArcInfo, GraphInfo > *	nth_arc (nat_t i) const

void	for_each_arc (Op &op) const

void	for_each_arc (Op &&op) const

ContainerRet	filter_arcs (Pred &pred) const

ContainerRet	filter_arcs (Pred &&pred=Pred()) const

ContainerRet	map_arcs (Op &op) const

ContainerRet	map_arcs (Op &&op=Op()) const

ContainerRet	map_arcs_if (Op &op, Pred &pred) const

ContainerRet	map_arcs_if (Op &op, Pred &&pred=Pred()) const

ContainerRet	map_arcs_if (Op &&op, Pred &pred) const

ContainerRet	map_arcs_if (Op &&op=Op(), Pred &&pred=Pred()) const

RetT	fold_arcs (const RetT &init_val, Op &op) const

RetT	fold_arcs (const RetT &init_val, Op &&op=Op()) const

RetT	fold_arcs (RetT &&init_val, Op &op) const

RetT	fold_arcs (RetT &&init_val, Op &&op=Op()) const

bool	all_arcs (Pred &pred) const

bool	all_arcs (Pred &&pred) const

bool	exists_arc (Pred &pred) const

bool	exists_arc (Pred &&pred) const

bool	none_arc (Pred &pred) const

bool	none_arc (Pred &&pred) const

DigraphArc< DigraphNode< NodeInfo, ArcInfo, GraphInfo >, NodeInfo, ArcInfo, GraphInfo > *	search_arc (Pred &pred) const

DigraphArc< DigraphNode< NodeInfo, ArcInfo, GraphInfo >, NodeInfo, ArcInfo, GraphInfo > *	search_arc (Pred &&pred) const

bool	remove_first_arc_if (Pred &pred)

bool	remove_first_arc_if (Pred &&pred)

void	remove_arc_if (Pred &pred)

void	remove_arc_if (Pred &&pred)

SLList< DigraphArc< DigraphNode< NodeInfo, ArcInfo, GraphInfo >, NodeInfo, ArcInfo, GraphInfo > * >	arcs () const

DigraphArc< DigraphNode< NodeInfo, ArcInfo, GraphInfo >, NodeInfo, ArcInfo, GraphInfo > *	nth_adjacent_arc (DigraphNode< NodeInfo, ArcInfo, GraphInfo > *p, nat_t i)

DigraphArc< DigraphNode< NodeInfo, ArcInfo, GraphInfo >, NodeInfo, ArcInfo, GraphInfo > *	nth_adjacent_arc (DigraphNode< NodeInfo, ArcInfo, GraphInfo > *p, nat_t i) const

void	for_each_adjacent_arc (DigraphNode< NodeInfo, ArcInfo, GraphInfo > *p, Op &op) const

void	for_each_adjacent_arc (DigraphNode< NodeInfo, ArcInfo, GraphInfo > *p, Op &&op) const

ContainerRet	filter_adjacent_arcs (DigraphNode< NodeInfo, ArcInfo, GraphInfo > *p, Pred &pred) const

ContainerRet	filter_adjacent_arcs (DigraphNode< NodeInfo, ArcInfo, GraphInfo > *p, Pred &&pred=Pred()) const

ContainerRet	map_adjacent_arcs (DigraphNode< NodeInfo, ArcInfo, GraphInfo > *p, Op &op) const

ContainerRet	map_adjacent_arcs (DigraphNode< NodeInfo, ArcInfo, GraphInfo > *p, Op &&op=Op()) const

ContainerRet	map_adjacent_arcs_if (DigraphNode< NodeInfo, ArcInfo, GraphInfo > *p, Op &op, Pred &pred) const

ContainerRet	map_adjacent_arcs_if (DigraphNode< NodeInfo, ArcInfo, GraphInfo > *p, Op &op, Pred &&pred=Pred()) const

ContainerRet	map_adjacent_arcs_if (DigraphNode< NodeInfo, ArcInfo, GraphInfo > *p, Op &&op, Pred &pred) const

ContainerRet	map_adjacent_arcs_if (DigraphNode< NodeInfo, ArcInfo, GraphInfo > *p, Op &&op=Op(), Pred &&pred=Pred()) const

RetT	fold_adjacent_arcs (DigraphNode< NodeInfo, ArcInfo, GraphInfo > *p, const RetT &init_val, Op &op) const

RetT	fold_adjacent_arcs (DigraphNode< NodeInfo, ArcInfo, GraphInfo > *p, const RetT &init_val, Op &&op=Op()) const

RetT	fold_adjacent_arcs (DigraphNode< NodeInfo, ArcInfo, GraphInfo > *p, RetT &&init_val, Op &op) const

RetT	fold_adjacent_arcs (DigraphNode< NodeInfo, ArcInfo, GraphInfo > *p, RetT &&init_val, Op &&op=Op()) const

bool	all_adjacent_arcs (DigraphNode< NodeInfo, ArcInfo, GraphInfo > *p, Pred &pred) const

bool	all_adjacent_arcs (DigraphNode< NodeInfo, ArcInfo, GraphInfo > *p, Pred &&pred) const

bool	exists_adjacent_arc (DigraphNode< NodeInfo, ArcInfo, GraphInfo > *p, Pred &pred) const

bool	exists_adjacent_arc (DigraphNode< NodeInfo, ArcInfo, GraphInfo > *p, Pred &&pred) const

bool	none_adjacent_arc (DigraphNode< NodeInfo, ArcInfo, GraphInfo > *p, Pred &pred) const

bool	none_adjacent_arc (DigraphNode< NodeInfo, ArcInfo, GraphInfo > *p, Pred &&pred) const

DigraphArc< DigraphNode< NodeInfo, ArcInfo, GraphInfo >, NodeInfo, ArcInfo, GraphInfo > *	search_adjacent_arc (DigraphNode< NodeInfo, ArcInfo, GraphInfo > *p, Pred &pred) const

DigraphArc< DigraphNode< NodeInfo, ArcInfo, GraphInfo >, NodeInfo, ArcInfo, GraphInfo > *	search_adjacent_arc (DigraphNode< NodeInfo, ArcInfo, GraphInfo > *p, Pred &&pred) const

bool	remove_first_adjacent_arc_if (DigraphNode< NodeInfo, ArcInfo, GraphInfo > *p, Pred &pred)

bool	remove_first_adjacent_arc_if (DigraphNode< NodeInfo, ArcInfo, GraphInfo > *p, Pred &&pred)

void	remove_adjacent_arc_if (DigraphNode< NodeInfo, ArcInfo, GraphInfo > *p, Pred &pred)

void	remove_adjacent_arc_if (DigraphNode< NodeInfo, ArcInfo, GraphInfo > *p, Pred &&pred)

SLList< DigraphArc< DigraphNode< NodeInfo, ArcInfo, GraphInfo >, NodeInfo, ArcInfo, GraphInfo > * >	adjacent_arcs (DigraphNode< NodeInfo, ArcInfo, GraphInfo > *p) const

void	reset_all_node_tag (GraphTag tag) const

void	reset_all_node_tag () const

void	reset_all_arc_tag (GraphTag tag) const

void	reset_all_arc_tag () const

void	reset_tag (GraphTag tag) const

void	reset_all_tags () const

void	reset_node_cookies () const

void	reset_arc_cookies () const

void	reset_node_counter () const

void	reset_arc_counter () const

void	reset_counters () const

void	reset_cookies () const

void	reset_nodes () const

void	reset_arcs () const

Protected Types
using	GNode = DLNode< Node >

using	GAdArc = DLNode< Arc >

using	GArc = DLNode< GAdArc * >

Protected Member Functions
GNode *	insert_gnode (GNode *p)

GAdArc *	insert_garc (Node src, Node tgt)

void	remove_arc (GAdArc *arc)

void	remove_node (GNode *)

Static Protected Member Functions
static GNode *	dl_to_node (DL *ptr)

static GArc *	dl_to_arc (DL *ptr)

static GAdArc *	dl_to_adjacent_arc (DL *ptr)

static GNode *	to_gnode (Node *node)

static GAdArc *	to_garc (Arc *arc)

Protected Attributes
GraphInfo	info

nat_t	num_nodes

DL	node_list

nat_t	num_arcs

DL	arc_list

Additional Inherited Members
Static Public Member Functions inherited from Designar::BaseGraph< Digraph< NodeInfo, ArcInfo, GraphInfo >, DigraphNode< NodeInfo, ArcInfo, GraphInfo >, DigraphArc< DigraphNode< NodeInfo, ArcInfo, GraphInfo >, NodeInfo, ArcInfo, GraphInfo >, NodeInfo, ArcInfo >
static void	copy_graph (const Digraph< NodeInfo, ArcInfo, GraphInfo > &, Digraph< NodeInfo, ArcInfo, GraphInfo > &)