dotprocs.h File Reference

#include "aspect.h"

Include dependency graph for dotprocs.h:

This graph shows which files directly or indirectly include this file:

Go to the source code of this file.

Functions
void	acyclic (Agraph_t *)
void	allocate_ranks (Agraph_t *)
void	build_ranks (Agraph_t *, int)
void	build_skeleton (Agraph_t *, Agraph_t *)
void	checkLabelOrder (graph_t *g)
void	class1 (Agraph_t *)
void	class2 (Agraph_t *)
void	decompose (Agraph_t *, int)
void	delete_fast_edge (Agedge_t *)
void	delete_fast_node (Agraph_t *, Agnode_t *)
void	delete_flat_edge (Agedge_t *)
void	dot_cleanup (graph_t *g)
void	dot_layout (Agraph_t *g)
void	dot_init_node_edge (graph_t *g)
void	dot_scan_ranks (graph_t *g)
void	enqueue_neighbors (nodequeue *q, node_t *n0, int pass)
void	expand_cluster (Agraph_t *)
Agedge_t *	fast_edge (Agedge_t *)
void	fast_node (Agraph_t *, Agnode_t *)
void	fast_nodeapp (Agnode_t *, Agnode_t *)
Agedge_t *	find_fast_edge (Agnode_t *, Agnode_t *)
Agedge_t *	find_flat_edge (Agnode_t *, Agnode_t *)
void	flat_edge (Agraph_t *, Agedge_t *)
int	flat_edges (Agraph_t *)
void	install_cluster (Agraph_t *, Agnode_t *, int, nodequeue *)
void	install_in_rank (Agraph_t *, Agnode_t *)
int	is_cluster (Agraph_t *)
void	dot_compoundEdges (Agraph_t *)
Agedge_t *	make_aux_edge (Agnode_t *, Agnode_t *, double, int)
void	mark_clusters (Agraph_t *)
void	mark_lowclusters (Agraph_t *)
int	mergeable (edge_t *e, edge_t *f)
void	merge_chain (Agraph_t *, Agedge_t *, Agedge_t *, int)
void	merge_oneway (Agedge_t *, Agedge_t *)
int	ncross (Agraph_t *)
Agedge_t *	new_virtual_edge (Agnode_t *, Agnode_t *, Agedge_t *)
int	nonconstraint_edge (Agedge_t *)
void	other_edge (Agedge_t *)
void	rank1 (graph_t *g)
int	portcmp (port p0, port p1)
int	ports_eq (edge_t *, edge_t *)
void	rec_reset_vlists (Agraph_t *)
void	rec_save_vlists (Agraph_t *)
void	reverse_edge (Agedge_t *)
void	safe_other_edge (Agedge_t *)
void	save_vlist (Agraph_t *)
void	unmerge_oneway (Agedge_t *)
Agedge_t *	virtual_edge (Agnode_t *, Agnode_t *, Agedge_t *)
Agnode_t *	virtual_node (Agraph_t *)
void	virtual_weight (Agedge_t *)
void	zapinlist (elist *, Agedge_t *)
Agraph_t *	dot_root (void *)
void	dot_concentrate (Agraph_t *)
void	dot_mincross (Agraph_t *, int)
void	dot_position (Agraph_t *, aspect_t *)
void	dot_rank (Agraph_t *, aspect_t *)
void	dot_sameports (Agraph_t *)
void	dot_splines (Agraph_t *)

Function Documentation

void acyclic

(

Agraph_t *

)

Definition at line 57 of file acyclic.c.

References FALSE, GD_comp, GD_nlist, ND_mark, and ND_next.

void allocate_ranks

(

Agraph_t *

)

Definition at line 1301 of file mincross.c.

References agfstnode(), agfstout(), aghead(), agnxtnode(), agnxtout(), agtail(), GD_maxrank, GD_minrank, GD_rank, N_NEW, and ND_rank.

Referenced by expand_cluster().

void build_ranks	(	Agraph_t *	,
		int
	)

Definition at line 1379 of file mincross.c.

References agerr(), AGERR, aghead(), agtail(), assert, CLUSTER, dequeue(), dot_root(), enqueue(), enqueue_neighbors(), exchange, FALSE, free_queue(), GD_flip, GD_maxrank, GD_minrank, GD_n_nodes, GD_nlist, GD_rank, install_cluster(), install_in_rank(), MARK, ncross(), ND_in, ND_next, ND_out, ND_ranktype, new_queue(), NULL, and TRUE.

Referenced by expand_cluster().

void build_skeleton	(	Agraph_t *	,
		Agraph_t *
	)

Definition at line 342 of file cluster.c.

References agfstnode(), agfstout(), aghead(), agnxtnode(), agnxtout(), agtail(), CL_CROSS, CLUSTER, ED_count, ED_xpenalty, GD_maxrank, GD_minrank, GD_rankleader, N_NEW, ND_clust, ND_out, ND_rank, ND_ranktype, ND_UF_size, NULL, virtual_edge(), and virtual_node().

Referenced by class2().

void checkLabelOrder

(

graph_t *

g

)

Definition at line 287 of file mincross.c.

References agbindrec(), agclose(), aghead(), agnnodes(), agnode(), agopen(), Agstrictdirected, GD_maxrank, GD_minrank, GD_rank, rank_t::n, ND_alg, ND_hi, ND_lo, ND_np, ND_order, ND_out, NULL, and rank_t::v.

Referenced by flat_edges().

void class1

(

Agraph_t *

)

Definition at line 66 of file class1.c.

References agfindedge, agfstnode(), agfstout(), aghead(), agnxtnode(), agnxtout(), agtail(), ED_to_virt, find_fast_edge(), mark_clusters(), merge_oneway(), ND_clust, nonconstraint_edge(), NULL, UF_find(), and virtual_edge().

void class2

(

Agraph_t *

)

Definition at line 172 of file class2.c.

References agfindedge, agfstnode(), agfstout(), aghead(), agnxtnode(), agnxtout(), agtail(), ALLOC, build_skeleton(), Concentrate, dot_root(), ED_conc_opp_flag, ED_edge_type, ED_label, ED_to_virt, FALSE, fast_node(), flat_edge(), GD_clust, GD_comp, GD_n_cluster, GD_n_nodes, GD_nlist, IGNORED, mark_clusters(), merge_chain(), merge_oneway(), mergeable(), ND_clust, ND_rank, ND_weight_class, NULL, other_edge(), ports_eq(), TRUE, and UF_find().

Referenced by expand_cluster().

void decompose	(	Agraph_t *	,
		int
	)

Definition at line 200 of file decomp.c.

References agfstnode(), agnxtnode(), GD_comp, GD_n_nodes, GD_rankleader, ND_clust, ND_mark, ND_rank, SMALLBUF, and UF_find().

void delete_fast_edge

(

Agedge_t *

)

Definition at line 115 of file fastgr.c.

References aghead(), agtail(), assert, ND_in, ND_out, NULL, and zapinlist().

Referenced by reverse_edge().

void delete_fast_node	(	Agraph_t *	,
		Agnode_t *
	)

Definition at line 229 of file fastgr.c.

References assert, GD_nlist, ND_next, and ND_prev.

void delete_flat_edge

(

Agedge_t *

)

Definition at line 267 of file fastgr.c.

References aghead(), agtail(), assert, ED_to_orig, ED_to_virt, ND_flat_in, ND_flat_out, NULL, and zapinlist().

void dot_cleanup

(

graph_t *

g

)

Definition at line 180 of file dotinit.c.

void dot_compoundEdges

(

Agraph_t *

)

Definition at line 494 of file compound.c.

References agfstnode(), agfstout(), agnxtnode(), agnxtout(), dtclose(), and mkClustMap().

void dot_concentrate

(

Agraph_t *

)

Definition at line 197 of file conc.c.

References agerr(), AGPREV, DOWN, FALSE, GD_clust, GD_maxrank, GD_minrank, GD_n_cluster, GD_rank, left, right, and UP.

Referenced by dot_position().

void dot_init_node_edge

(

graph_t *

g

)

Definition at line 75 of file dotinit.c.

References agfstnode(), agfstout(), agnxtnode(), and agnxtout().

void dot_layout

(

Agraph_t *

g

)

Definition at line 507 of file dotinit.c.

void dot_mincross	(	Agraph_t *	,
		int
	)

Definition at line 332 of file mincross.c.

References agget(), GD_clust, GD_comp, GD_n_cluster, mapbool(), mark_lowclusters(), and TRUE.

void dot_position	(	Agraph_t *	,
		aspect_t *
	)

Definition at line 120 of file position.c.

References assert, Concentrate, dot_concentrate(), flat_edges(), GD_nlist, mark_lowclusters(), NULL, and rank().

void dot_rank	(	Agraph_t *	,
		aspect_t *
	)

Definition at line 573 of file rank.c.

References agget(), GD_flags, GD_maxrank, GD_minrank, NEW_RANK, and Verbose.

Agraph_t* dot_root

(

void *

)

Definition at line 513 of file dotinit.c.

References agroot(), and GD_dotroot.

Referenced by build_ranks(), class2(), flat_edge(), interclexp(), and rec_reset_vlists().

void dot_sameports

(

Agraph_t *

)

Definition at line 34 of file sameport.c.

References agattr(), AGEDGE, agfstedge(), agfstnode(), aghead(), agnxtedge(), agnxtnode(), agtail(), agxget(), E_samehead, E_sametail, free_list, and MAXSAME.

void dot_scan_ranks

(

graph_t *

g

)

Definition at line 204 of file rank.c.

References agfstnode(), agnxtnode(), GD_leader, GD_maxrank, GD_minrank, MAXSHORT, ND_rank, and NULL.

void dot_splines

(

Agraph_t *

)

Definition at line 519 of file dotsplines.c.

void enqueue_neighbors	(	nodequeue *	q,
		node_t *	n0,
		int	pass
	)

Definition at line 1441 of file mincross.c.

References aghead(), agtail(), enqueue(), FALSE, MARK, ND_in, ND_out, and TRUE.

Referenced by build_ranks(), and install_cluster().

void expand_cluster

(

Agraph_t *

)

Definition at line 282 of file cluster.c.

References allocate_ranks(), build_ranks(), class2(), GD_comp, GD_nlist, and interclexp().

Agedge_t* fast_edge

(

Agedge_t *

)

Definition at line 74 of file fastgr.c.

References aghead(), agtail(), assert, elist_append, ND_in, and ND_out.

Referenced by make_aux_edge(), and virtual_edge().

void fast_node	(	Agraph_t *	,
		Agnode_t *
	)

Definition at line 204 of file fastgr.c.

References assert, GD_nlist, ND_next, ND_prev, and NULL.

Referenced by class2(), and virtual_node().

void fast_nodeapp	(	Agnode_t *	,
		Agnode_t *
	)

Definition at line 218 of file fastgr.c.

References assert, ND_next, ND_prev, and NULL.

Agedge_t* find_fast_edge	(	Agnode_t *	,
		Agnode_t *
	)

Definition at line 42 of file fastgr.c.

References ND_in, and ND_out.

Referenced by class1(), and reverse_edge().

Agedge_t* find_flat_edge	(	Agnode_t *	,
		Agnode_t *
	)

Definition at line 57 of file fastgr.c.

References ND_flat_in, and ND_flat_out.

Referenced by interclexp().

void flat_edge	(	Agraph_t *	,
		Agedge_t *
	)

Definition at line 260 of file fastgr.c.

References aghead(), agtail(), dot_root(), elist_append, GD_has_flat_edges, ND_flat_in, ND_flat_out, and TRUE.

Referenced by class2(), flat_rev(), and interclexp().

int flat_edges

(

Agraph_t *

)

Definition at line 260 of file flat.c.

References aghead(), agtail(), checkLabelOrder(), ED_adjacent, ED_dist, ED_label, ED_to_virt, FALSE, GD_flip, GD_n_cluster, GD_nlist, GD_rank, le, MAX, ND_flat_in, ND_flat_out, ND_next, ND_other, ND_rank, rec_reset_vlists(), rec_save_vlists(), and TRUE.

Referenced by dot_position().

void install_cluster	(	Agraph_t *	,
		Agnode_t *	,
		int	,
		nodequeue *
	)

Definition at line 379 of file cluster.c.

References enqueue_neighbors(), GD_installed, GD_maxrank, GD_minrank, GD_rankleader, install_in_rank(), and ND_clust.

Referenced by build_ranks().

void install_in_rank	(	Agraph_t *	,
		Agnode_t *
	)

Definition at line 1331 of file mincross.c.

References agerr(), AGERR, agnameof(), assert, GD_maxrank, GD_minrank, GD_nlist, GD_rank, ND_next, ND_order, ND_rank, and NULL.

Referenced by build_ranks(), and install_cluster().

int is_cluster

(

Agraph_t *

)

Definition at line 585 of file rank.c.

References agnameof().

Agedge_t* make_aux_edge	(	Agnode_t *	,
		Agnode_t *	,
		double	,
		int
	)

Definition at line 173 of file position.c.

References aghead(), AGINEDGE, AGOUTEDGE, agtail(), AGTYPE, Agedge_s::base, Agobj_s::data, ED_minlen, ED_weight, fast_edge(), Agedgepair_s::in, NEW, Agedgepair_s::out, and ROUND.

void mark_clusters

(

Agraph_t *

)

Definition at line 298 of file cluster.c.

References agdelete(), agerr(), agfstnode(), agfstout(), aghead(), agnameof(), agnxtnode(), agnxtout(), AGWARN, CLUSTER, ED_to_virt, GD_clust, GD_leader, GD_n_cluster, ND_clust, ND_node_type, ND_out, ND_ranktype, NORMAL, NULL, UF_setname(), UF_singleton(), and VIRTUAL.

Referenced by class1(), and class2().

void mark_lowclusters

(

Agraph_t *

)

Definition at line 395 of file cluster.c.

References agfstnode(), agfstout(), aghead(), agnxtnode(), agnxtout(), ED_to_virt, ND_clust, ND_node_type, ND_out, NULL, and VIRTUAL.

Referenced by dot_mincross(), and dot_position().

void merge_chain	(	Agraph_t *	,
		Agedge_t *	,
		Agedge_t *	,
		int
	)

Definition at line 143 of file class2.c.

References aghead(), agtail(), assert, ED_count, ED_to_virt, ED_weight, ED_xpenalty, MAX, ND_out, ND_rank, and NULL.

Referenced by class2(), and interclexp().

void merge_oneway	(	Agedge_t *	,
		Agedge_t *
	)

Definition at line 334 of file fastgr.c.

References agerr(), AGWARN, assert, ED_to_virt, and NULL.

Referenced by class1(), class2(), flat_rev(), interclexp(), and reverse_edge().

int mergeable	(	edge_t *	e,
		edge_t *	f
	)

Definition at line 164 of file class2.c.

References aghead(), agtail(), ED_label, FALSE, ports_eq(), and TRUE.

Referenced by class2(), and interclexp().

int ncross

(

Agraph_t *

)

Definition at line 1741 of file mincross.c.

References GD_maxrank, GD_minrank, GD_rank, and TRUE.

Referenced by build_ranks().

Agedge_t* new_virtual_edge	(	Agnode_t *	,
		Agnode_t *	,
		Agedge_t *
	)

Definition at line 162 of file fastgr.c.

References aghead(), AGINEDGE, AGOUTEDGE, AGSEQ, agtail(), AGTYPE, Agedge_s::base, Agobj_s::data, ED_count, ED_edge_type, ED_head_port, ED_minlen, ED_tail_port, ED_to_orig, ED_to_virt, ED_weight, ED_xpenalty, Agedgepair_s::in, NEW, NULL, Agedgepair_s::out, and VIRTUAL.

Referenced by flat_rev(), and virtual_edge().

int nonconstraint_edge

(

Agedge_t *

)

Definition at line 23 of file class1.c.

References agxget(), E_constr, FALSE, mapbool(), and TRUE.

Referenced by class1().

void other_edge

(

Agedge_t *

)

Definition at line 137 of file fastgr.c.

References agtail(), elist_append, and ND_other.

Referenced by class2().

int portcmp	(	port	p0,
		port	p1
	)

Definition at line 116 of file dotsplines.c.

References port::defined, FALSE, port::p, pointf_s::x, and pointf_s::y.

int ports_eq	(	edge_t *	,
		edge_t *
	)

Definition at line 1126 of file position.c.

References ED_head_port, ED_tail_port, FALSE, pointf_s::x, and pointf_s::y.

Referenced by class2(), and mergeable().

void rank1

(

graph_t *

g

)

Definition at line 386 of file rank.c.

References agget(), agnnodes(), GD_comp, GD_n_cluster, GD_nlist, INT_MAX, and rank().

Referenced by rank3().

void rec_reset_vlists

(

Agraph_t *

)

Definition at line 1090 of file mincross.c.

References assert, dot_root(), GD_clust, GD_maxrank, GD_minrank, GD_n_cluster, GD_rank, GD_rankleader, ND_order, and rec_reset_vlists().

Referenced by flat_edges(), and rec_reset_vlists().

void rec_save_vlists

(

Agraph_t *

)

Definition at line 1080 of file mincross.c.

References GD_clust, GD_n_cluster, rec_save_vlists(), and save_vlist().

Referenced by flat_edges(), and rec_save_vlists().

void reverse_edge

(

Agedge_t *

)

Definition at line 21 of file acyclic.c.

References aghead(), agtail(), delete_fast_edge(), find_fast_edge(), merge_oneway(), and virtual_edge().

void safe_other_edge

(

Agedge_t *

)

Definition at line 142 of file fastgr.c.

References agtail(), and ND_other.

Referenced by interclexp().

void save_vlist

(

Agraph_t *

)

Definition at line 1070 of file mincross.c.

References GD_maxrank, GD_minrank, GD_rank, and GD_rankleader.

Referenced by rec_save_vlists().

void unmerge_oneway

(

Agedge_t *

)

Definition at line 353 of file fastgr.c.

References aghead(), ED_count, ED_edge_type, ED_to_virt, ND_node_type, ND_out, NULL, and VIRTUAL.

Agedge_t* virtual_edge	(	Agnode_t *	,
		Agnode_t *	,
		Agedge_t *
	)

Definition at line 199 of file fastgr.c.

References fast_edge(), and new_virtual_edge().

Referenced by build_skeleton(), class1(), and reverse_edge().

Agnode_t* virtual_node

(

Agraph_t *

)

Definition at line 240 of file fastgr.c.

References AGNODE, agroot(), AGTYPE, alloc_elist, Agnode_s::base, Agobj_s::data, fast_node(), GD_n_nodes, ND_ht, ND_in, ND_lw, ND_node_type, ND_out, ND_rw, ND_UF_size, NEW, Agnode_s::root, and VIRTUAL.

Referenced by build_skeleton().

void virtual_weight

(

Agedge_t *

)

Definition at line 1900 of file mincross.c.

References aghead(), agtail(), and ED_weight.

void zapinlist	(	elist *	,
		Agedge_t *
	)

Definition at line 100 of file fastgr.c.

References elist::list, NULL, and elist::size.

Referenced by delete_fast_edge(), and delete_flat_edge().