lib/dotgen/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	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	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 *)
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 GD_comp, GD_nlist, ND_next, ND_mark, and FALSE.

void allocate_ranks

(

Agraph_t *

)

Definition at line 1052 of file mincross.c.

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

Referenced by expand_cluster().

void build_ranks	(	Agraph_t *	,
		int
	)

Definition at line 1130 of file mincross.c.

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

Referenced by expand_cluster().

void build_skeleton	(	Agraph_t *	,
		Agraph_t *
	)

Definition at line 402 of file cluster.c.

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

Referenced by class2().

void class1

(

Agraph_t *

)

Definition at line 70 of file class1.c.

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

void class2

(

Agraph_t *

)

Definition at line 173 of file class2.c.

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

Referenced by expand_cluster().

void decompose	(	Agraph_t *	,
		int
	)

Definition at line 87 of file decomp.c.

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

void delete_fast_edge

(

Agedge_t *

)

Definition at line 115 of file fastgr.c.

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

Referenced by reverse_edge().

void delete_fast_node	(	Agraph_t *	,
		Agnode_t *
	)

Definition at line 235 of file fastgr.c.

References assert, ND_next, ND_prev, and GD_nlist.

void delete_flat_edge

(

Agedge_t *

)

Definition at line 278 of file fastgr.c.

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

void dot_cleanup

(

graph_t *

g

)

Definition at line 202 of file dotinit.c.

void dot_compoundEdges

(

Agraph_t *

)

Definition at line 503 of file compound.c.

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

Referenced by dot_layout().

void dot_concentrate

(

Agraph_t *

)

Definition at line 197 of file conc.c.

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

Referenced by dot_position().

void dot_init_node_edge

(

graph_t *

g

)

Definition at line 77 of file dotinit.c.

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

Referenced by dot_layout().

void dot_layout

(

Agraph_t *

g

)

Definition at line 328 of file dotinit.c.

void dot_mincross	(	Agraph_t *	,
		int
	)

Definition at line 71 of file mincross.c.

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

Referenced by dot_layout().

void dot_position	(	Agraph_t *	,
		aspect_t *
	)

Definition at line 119 of file position.c.

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

Referenced by dot_layout().

void dot_rank	(	Agraph_t *	,
		aspect_t *
	)

Definition at line 615 of file rank.c.

References agget(), GD_flags, and NEW_RANK.

Referenced by dot_layout().

void dot_sameports

(

Agraph_t *

)

Definition at line 35 of file sameport.c.

References MAXSAME, E_samehead, agfindattr(), Agraph_t::proto, Agproto_t::e, E_sametail, agattr(), AGEDGE, agfstnode(), agnxtnode(), agfstedge(), agnxtedge(), aghead, agtail, agxget(), Agsym_t::index, and free_list.

Referenced by dot_layout().

void dot_scan_ranks

(

graph_t *

g

)

Definition at line 221 of file rank.c.

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

void dot_splines

(

Agraph_t *

)

Definition at line 530 of file dotsplines.c.

Referenced by dot_layout().

void expand_cluster

(

Agraph_t *

)

Definition at line 338 of file cluster.c.

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

Agedge_t* fast_edge

(

Agedge_t *

)

Definition at line 74 of file fastgr.c.

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

Referenced by virtual_edge(), and make_aux_edge().

void fast_node	(	Agraph_t *	,
		Agnode_t *
	)

Definition at line 210 of file fastgr.c.

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

Referenced by class2(), and virtual_node().

void fast_nodeapp	(	Agnode_t *	,
		Agnode_t *
	)

Definition at line 224 of file fastgr.c.

References assert, ND_next, NULL, and ND_prev.

Agedge_t* find_fast_edge	(	Agnode_t *	,
		Agnode_t *
	)

Definition at line 42 of file fastgr.c.

References ND_out, and ND_in.

Referenced by reverse_edge(), and class1().

Agedge_t* find_flat_edge	(	Agnode_t *	,
		Agnode_t *
	)

Definition at line 57 of file fastgr.c.

References ND_flat_out, and ND_flat_in.

Referenced by interclexp().

void flat_edge	(	Agraph_t *	,
		Agedge_t *
	)

Definition at line 271 of file fastgr.c.

References elist_append, ND_flat_out, agtail, ND_flat_in, aghead, GD_has_flat_edges, agroot, and TRUE.

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

int flat_edges

(

Agraph_t *

)

Definition at line 260 of file flat.c.

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

Referenced by dot_position().

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

Definition at line 439 of file cluster.c.

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

Referenced by build_ranks().

void install_in_rank	(	Agraph_t *	,
		Agnode_t *
	)

Definition at line 1082 of file mincross.c.

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

Referenced by install_cluster(), and build_ranks().

int is_cluster

(

Agraph_t *

)

Definition at line 627 of file rank.c.

References agnameof.

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

Definition at line 171 of file position.c.

References NEW, agtail, aghead, ED_minlen, ROUND, ED_weight, and fast_edge().

Referenced by nonconstraint_edge().

void mark_clusters

(

Agraph_t *

)

Definition at line 354 of file cluster.c.

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

Referenced by class1(), and class2().

void mark_lowclusters

(

Agraph_t *

)

Definition at line 455 of file cluster.c.

References agfstnode(), agnxtnode(), ND_clust, NULL, agfstout(), agnxtout(), ED_to_virt, Agedge_t::head, Agedge_t::u, VIRTUAL, ND_node_type, aghead, ND_out, GD_n_cluster, and GD_clust.

Referenced by dot_mincross(), and dot_position().

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

Definition at line 144 of file class2.c.

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

Referenced by class2(), and interclexp().

void merge_oneway	(	Agedge_t *	,
		Agedge_t *
	)

Definition at line 345 of file fastgr.c.

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

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

int mergeable	(	edge_t *	e,
		edge_t *	f
	)

Definition at line 165 of file class2.c.

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

Referenced by class2(), and interclexp().

int ncross

(

Agraph_t *

)

Definition at line 1485 of file mincross.c.

References GD_minrank, GD_maxrank, 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 NEW, agtail, aghead, ED_edge_type, VIRTUAL, AGSEQ, ED_count, ED_xpenalty, ED_weight, ED_minlen, ED_tail_port, ED_head_port, ED_to_virt, NULL, and ED_to_orig.

Referenced by virtual_edge(), and flat_rev().

int nonconstraint_edge

(

Agedge_t *

)

Definition at line 23 of file class1.c.

References E_constr, agxget(), Agsym_t::index, mapbool(), FALSE, TRUE, ND_clust, agtail, ND_rank, GD_leader, aghead, ED_minlen, virtual_node(), ND_node_type, SLACKNODE, UF_find(), make_aux_edge(), CL_BACK, ED_weight, and ED_to_orig.

Referenced by class1().

void other_edge

(

Agedge_t *

)

Definition at line 137 of file fastgr.c.

References elist_append, ND_other, and agtail.

Referenced by class2().

int portcmp	(	port	p0,
		port	p1
	)

Definition at line 130 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 1172 of file position.c.

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

Referenced by mergeable(), and class2().

void rank1

(

graph_t *

g

)

Definition at line 428 of file rank.c.

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

Referenced by rank3().

void rec_reset_vlists

(

Agraph_t *

)

Definition at line 829 of file mincross.c.

References GD_n_cluster, rec_reset_vlists(), GD_clust, GD_rankleader, GD_minrank, GD_maxrank, assert, GD_rank, Agraph_t::root, ND_order, ND_rank, and agroot.

Referenced by flat_edges(), and rec_reset_vlists().

void rec_save_vlists

(

Agraph_t *

)

Definition at line 819 of file mincross.c.

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

Referenced by flat_edges(), and rec_save_vlists().

void reverse_edge

(

Agedge_t *

)

Definition at line 21 of file acyclic.c.

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

void safe_other_edge

(

Agedge_t *

)

Definition at line 142 of file fastgr.c.

References ND_other, and agtail.

Referenced by interclexp().

void save_vlist

(

Agraph_t *

)

Definition at line 809 of file mincross.c.

References GD_rankleader, GD_minrank, GD_maxrank, and GD_rank.

Referenced by rec_save_vlists().

void unmerge_oneway

(

Agedge_t *

)

Definition at line 364 of file fastgr.c.

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

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

Definition at line 205 of file fastgr.c.

References fast_edge(), and new_virtual_edge().

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

Agnode_t* virtual_node

(

Agraph_t *

)

Definition at line 246 of file fastgr.c.

References NEW, Agnode_t::name, Agnode_t::graph, AGNODE, ND_node_type, VIRTUAL, ND_lw, ND_rw, ND_ht, ND_UF_size, alloc_elist, ND_in, ND_out, fast_node(), and GD_n_nodes.

Referenced by nonconstraint_edge(), and build_skeleton().

void virtual_weight

(

Agedge_t *

)

Definition at line 1644 of file mincross.c.

References agtail, aghead, and ED_weight.

void zapinlist	(	elist *	,
		Agedge_t *
	)

Definition at line 100 of file fastgr.c.

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

Referenced by delete_fast_edge(), and delete_flat_edge().