dotprocs.h File Reference

#include <dotgen/aspect.h>
#include <stdbool.h>
#include <util/list.h>
#include <util/unused.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
typedef	LIST (Agnode_t *) node_queue_t
void	acyclic (Agraph_t *)
void	allocate_ranks (Agraph_t *)
int	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 (node_queue_t *q, node_t *n0, int pass)
int	expand_cluster (Agraph_t *)
Agedge_t *	fast_edge (Agedge_t *)
void	fast_node (Agraph_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 *)
int	install_cluster (Agraph_t *, Agnode_t *, int, node_queue_t *)
int	install_in_rank (Agraph_t *, Agnode_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 *)
bool	mergeable (edge_t *e, edge_t *f)
void	merge_chain (Agraph_t *, Agedge_t *, Agedge_t *, bool)
void	merge_oneway (Agedge_t *, Agedge_t *)
Agedge_t *	new_virtual_edge (Agnode_t *, Agnode_t *, Agedge_t *)
bool	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 *)
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 *)
	remove e from list and fill hole with last member of list
Agraph_t *	dot_root (void *)
WUR int	dot_concentrate (Agraph_t *)
int	dot_mincross (Agraph_t *)
WUR int	dot_position (Agraph_t *)
void	dot_rank (Agraph_t *)
void	dot_sameports (Agraph_t *)
int	dot_splines (Agraph_t *)

Function Documentation

acyclic()

void acyclic

(

Agraph_t *

g

)

Definition at line 58 of file acyclic.c.

References dfs(), GD_comp, GD_nlist, ND_mark, and ND_next.

Referenced by dot1_rank(), and makeGraphData().

Here is the call graph for this function:

Here is the caller graph for this function:

allocate_ranks()

void allocate_ranks

(

Agraph_t *

g

)

Definition at line 1122 of file mincross.c.

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

Referenced by expand_cluster(), and init_mincross().

Here is the call graph for this function:

Here is the caller graph for this function:

build_ranks()

int build_ranks	(	Agraph_t *	g,
		int	pass
	)

Returns

0 on success

Definition at line 1199 of file mincross.c.

References aghead, agroot(), agtail, CLUSTER, dot_root(), enqueue_neighbors(), exchange(), GD_flip, GD_maxrank, GD_minrank, GD_nlist, GD_rank, install_cluster(), install_in_rank(), LIST_FREE, LIST_IS_EMPTY, LIST_POP_FRONT, LIST_PUSH_BACK, MARK, ncross(), ND_in, ND_next, ND_out, ND_prev, ND_ranktype, NULL, Root, and transpose().

Referenced by expand_cluster(), and mincross().

Here is the call graph for this function:

Here is the caller graph for this function:

build_skeleton()

void build_skeleton	(	Agraph_t *	g,
		Agraph_t *	subg
	)

Definition at line 343 of file cluster.c.

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

Referenced by class2().

Here is the call graph for this function:

Here is the caller graph for this function:

checkLabelOrder()

void checkLabelOrder

(

graph_t *

g

)

Definition at line 297 of file mincross.c.

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

Referenced by flat_edges().

Here is the call graph for this function:

Here is the caller graph for this function:

class1()

void class1

(

Agraph_t *

g

)

Definition at line 63 of file class1.c.

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

Referenced by dot1_rank().

Here is the call graph for this function:

Here is the caller graph for this function:

class2()

void class2

(

Agraph_t *

g

)

Definition at line 155 of file class2.c.

References agfstnode(), agfstout(), aghead, agnxtnode(), agnxtout(), agtail, build_skeleton(), Concentrate, dot_root(), ED_conc_opp_flag, ED_edge_type, ED_label, ED_to_virt, fast_node(), flat_edge(), free(), GD_clust, GD_comp, GD_n_cluster, GD_nlist, gv_alloc(), IGNORED, interclrep(), is_cluster_edge(), make_chain(), mark_clusters(), merge_chain(), merge_oneway(), mergeable(), ND_clust, ND_rank, ND_weight_class, NULL, other_edge(), ports_eq(), prev, and UF_find().

Referenced by expand_cluster(), and init_mincross().

Here is the call graph for this function:

Here is the caller graph for this function:

decompose()

void decompose	(	Agraph_t *	g,
		int	pass
	)

Definition at line 108 of file decomp.c.

References agfstnode(), agnxtnode(), begin_component(), Cmark, end_component(), GD_comp, GD_rankleader, LIST_FREE, ND_clust, ND_mark, ND_rank, search_component(), and UF_find().

Referenced by dot1_rank(), and init_mincross().

Here is the call graph for this function:

Here is the caller graph for this function:

delete_fast_edge()

void delete_fast_edge

(

Agedge_t *

e

)

Definition at line 109 of file fastgr.c.

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

Referenced by free_virtual_edge_list(), map_path(), mergevirtual(), remove_rankleaders(), and reverse_edge().

Here is the call graph for this function:

Here is the caller graph for this function:

delete_fast_node()

void delete_fast_node	(	Agraph_t *	g,
		Agnode_t *	n
	)

Definition at line 189 of file fastgr.c.

References find_fast_node(), GD_nlist, ND_next, and ND_prev.

Referenced by merge_ranks(), mergevirtual(), remove_rankleaders(), and removeFill().

Here is the call graph for this function:

Here is the caller graph for this function:

delete_flat_edge()

void delete_flat_edge

(

Agedge_t *

e

)

Definition at line 222 of file fastgr.c.

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

Referenced by cleanup2(), flat_reorder(), and flat_search().

Here is the call graph for this function:

Here is the caller graph for this function:

dot_cleanup()

void dot_cleanup

(

graph_t *

g

)

Definition at line 181 of file dotinit.c.

dot_compoundEdges()

void dot_compoundEdges

(

Agraph_t *

g

)

Definition at line 434 of file compound.c.

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

Referenced by dotLayout().

Here is the call graph for this function:

Here is the caller graph for this function:

dot_concentrate()

WUR int dot_concentrate

(

Agraph_t *

g

)

Returns

0 on success

Definition at line 202 of file conc.c.

References agerr(), AGPREV, bothdowncandidates(), bothupcandidates(), DOWN, downcandidate(), GD_clust, GD_maxrank, GD_minrank, GD_n_cluster, GD_rank, left, mergevirtual(), rebuild_vlists(), right, UP, and upcandidate().

Referenced by dot_position().

Here is the call graph for this function:

Here is the caller graph for this function:

dot_init_node_edge()

void dot_init_node_edge

(

graph_t *

g

)

Definition at line 89 of file dotinit.c.

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

Referenced by dotLayout(), and make_flat_adj_edges().

Here is the call graph for this function:

Here is the caller graph for this function:

dot_layout()

void dot_layout

(

Agraph_t *

g

)

Definition at line 473 of file dotinit.c.

dot_mincross()

int dot_mincross

(

Agraph_t *

g

)

Returns

0 on success

Definition at line 332 of file mincross.c.

References agfstnode(), agget(), agwarningf(), cleanup2(), GD_clust, GD_comp, GD_n_cluster, init_mccomp(), init_mincross(), mapbool(), mark_lowclusters(), merge2(), mincross(), mincross_clust(), NULL, and ReMincross.

Referenced by dotLayout(), and make_flat_adj_edges().

Here is the call graph for this function:

Here is the caller graph for this function:

dot_position()

WUR int dot_position

(

Agraph_t *

g

)

Returns

0 on success

Definition at line 121 of file position.c.

References Concentrate, connectGraph(), create_aux_edges(), dot_concentrate(), expand_leaves(), flat_edges(), GD_nlist, mark_lowclusters(), nsiter2(), NULL, rank(), remove_aux_edges(), set_aspect(), set_xcoords(), and set_ycoords().

Referenced by dotLayout(), and make_flat_adj_edges().

Here is the call graph for this function:

Here is the caller graph for this function:

dot_rank()

void dot_rank

(

Agraph_t *

g

)

Definition at line 528 of file rank.c.

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

Referenced by dotLayout(), and make_flat_adj_edges().

Here is the call graph for this function:

Here is the caller graph for this function:

dot_root()

Agraph_t * dot_root

(

void *

p

)

Definition at line 483 of file dotinit.c.

References agroot(), and GD_dotroot.

Referenced by adjustRanks(), adjustSimple(), build_ranks(), checkFlatAdjacent(), class2(), clust_ht(), contain_clustnodes(), dot_compute_bb(), expand_ranksets(), find_clusters(), flat_edge(), flat_node(), flat_search(), init_mincross(), interclexp(), keepout_othernodes(), make_lrvn(), map_path(), merge_ranks(), mincross(), node_induce(), realFillRanks(), rebuild_vlists(), rec_reset_vlists(), and remove_rankleaders().

Here is the call graph for this function:

Here is the caller graph for this function:

dot_sameports()

void dot_sameports

(

Agraph_t *

)

Referenced by dotLayout(), and make_flat_adj_edges().

Here is the caller graph for this function:

dot_scan_ranks()

void dot_scan_ranks

(

graph_t *

g

)

Definition at line 282 of file rank.c.

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

Referenced by collapse_cluster(), and rebuild_vlists().

Here is the call graph for this function:

Here is the caller graph for this function:

dot_splines()

int dot_splines

(

Agraph_t *

g

)

Returns

0 on success

Definition at line 487 of file dotsplines.c.

References dot_splines_().

Referenced by dotLayout().

Here is the call graph for this function:

Here is the caller graph for this function:

enqueue_neighbors()

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

Definition at line 1275 of file mincross.c.

References aghead, agtail, LIST_PUSH_BACK, MARK, ND_in, and ND_out.

Referenced by build_ranks(), and install_cluster().

Here is the caller graph for this function:

expand_cluster()

int expand_cluster

(

Agraph_t *

subg

)

Returns

0 on success

Definition at line 280 of file cluster.c.

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

Referenced by mincross_clust().

Here is the call graph for this function:

Here is the caller graph for this function:

fast_edge()

Agedge_t * fast_edge

(

Agedge_t *

e

)

Definition at line 71 of file fastgr.c.

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

Referenced by expand_leaves(), make_aux_edge(), and virtual_edge().

Here is the caller graph for this function:

fast_node()

void fast_node	(	Agraph_t *	g,
		Agnode_t *	n
	)

Definition at line 175 of file fastgr.c.

References find_fast_node(), GD_nlist, ND_next, ND_prev, and NULL.

Referenced by class2(), merge_ranks(), and virtual_node().

Here is the call graph for this function:

Here is the caller graph for this function:

find_fast_edge()

Agedge_t * find_fast_edge	(	Agnode_t *	u,
		Agnode_t *	v
	)

Definition at line 43 of file fastgr.c.

References ffe(), ND_in, and ND_out.

Referenced by class1(), contain_clustnodes(), interclrep(), make_LR_constraints(), map_path(), and reverse_edge().

Here is the call graph for this function:

Here is the caller graph for this function:

find_flat_edge()

Agedge_t * find_flat_edge	(	Agnode_t *	u,
		Agnode_t *	v
	)

Definition at line 56 of file fastgr.c.

References ffe(), ND_flat_in, and ND_flat_out.

Referenced by do_ordering_node(), and interclexp().

Here is the call graph for this function:

Here is the caller graph for this function:

flat_edge()

void flat_edge	(	Agraph_t *	g,
		Agedge_t *	e
	)

Definition at line 215 of file fastgr.c.

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

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

Here is the call graph for this function:

Here is the caller graph for this function:

flat_edges()

int flat_edges

(

Agraph_t *

g

)

Definition at line 257 of file flat.c.

References abomination(), aghead, agtail, checkFlatAdjacent(), checkLabelOrder(), ED_adjacent, ED_dist, ED_label, ED_to_virt, flat_node(), 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 reset().

Referenced by dot_position().

Here is the call graph for this function:

Here is the caller graph for this function:

install_cluster()

int install_cluster	(	Agraph_t *	g,
		Agnode_t *	n,
		int	pass,
		node_queue_t *	q
	)

Returns

0 on success

Definition at line 380 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().

Here is the call graph for this function:

Here is the caller graph for this function:

install_in_rank()

int install_in_rank	(	Agraph_t *	g,
		Agnode_t *	n
	)

Returns

0 on success

Definition at line 1150 of file mincross.c.

References agerrorf(), agnameof(), GD_maxrank, GD_minrank, GD_nlist, GD_rank, ND_next, ND_order, ND_rank, NULL, and Root.

Referenced by build_ranks(), and install_cluster().

Here is the call graph for this function:

Here is the caller graph for this function:

LIST()

typedef LIST

(

Agnode_t *

)

Definition at line 114 of file sccmap.c.

References agbindrec(), agdeledge(), agdelnode(), agfstout(), aghead, agnode(), agnxtout(), agraphof(), agsubg(), agsubnode(), agwrite(), Cmark, sccstate::Comp, DEGREE, findSource(), free(), G, getval(), sccstate::ID, INF, LIST_APPEND, LIST_BACK, LIST_DROP_BACK, LIST_FREE, LIST_POP_BACK, LIST_PUSH_BACK, sccstate::N_nodes_in_nontriv_SCC, ND_mark, ND_np, nodeInduce(), NULL, outfp, Agnode_s::root, setrep(), setscc(), setval(), StatsOnly, and wantDegenerateComp.

Here is the call graph for this function:

make_aux_edge()

Agedge_t * make_aux_edge	(	Agnode_t *	u,
		Agnode_t *	v,
		double	len,
		int	wt
	)

Definition at line 179 of file position.c.

References agerrorf(), aghead, AGINEDGE, AGOUTEDGE, agtail, AGTYPE, Agedge_s::base, Agobj_s::data, ED_minlen, ED_weight, fast_edge(), free(), gv_alloc(), Agedgepair_s::in, len(), NULL, Agedgepair_s::out, and ROUND.

Referenced by compress_graph(), connectGraph(), contain_clustnodes(), contain_nodes(), contain_subclust(), interclust1(), keepout_othernodes(), make_edge_pairs(), make_LR_constraints(), make_lrvn(), and separate_subclust().

Here is the call graph for this function:

Here is the caller graph for this function:

mark_clusters()

void mark_clusters

(

Agraph_t *

g

)

Definition at line 299 of file cluster.c.

References agdelete(), agfstnode(), agfstout(), aghead, agnameof(), agnxtnode(), agnxtout(), agwarningf(), 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().

Here is the call graph for this function:

Here is the caller graph for this function:

mark_lowclusters()

void mark_lowclusters

(

Agraph_t *

root

)

Definition at line 400 of file cluster.c.

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

Referenced by dot_mincross(), dot_position(), and dot_splines_().

Here is the call graph for this function:

Here is the caller graph for this function:

merge_chain()

void merge_chain	(	Agraph_t *	g,
		Agedge_t *	e,
		Agedge_t *	f,
		bool	update_count
	)

Definition at line 130 of file class2.c.

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

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

Here is the call graph for this function:

Here is the caller graph for this function:

merge_oneway()

void merge_oneway	(	Agedge_t *	e,
		Agedge_t *	rep
	)

Definition at line 245 of file fastgr.c.

References agwarningf(), basic_merge(), ED_to_virt, and NULL.

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

Here is the call graph for this function:

Here is the caller graph for this function:

mergeable()

bool mergeable	(	edge_t *	e,
		edge_t *	f
	)

Definition at line 150 of file class2.c.

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

Referenced by class2(), and interclexp().

Here is the call graph for this function:

Here is the caller graph for this function:

new_virtual_edge()

Agedge_t * new_virtual_edge	(	Agnode_t *	u,
		Agnode_t *	v,
		Agedge_t *	orig
	)

Definition at line 131 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, gv_alloc(), Agedgepair_s::in, NULL, Agedgepair_s::out, and VIRTUAL.

Referenced by do_ordering_node(), flat_rev(), and virtual_edge().

Here is the call graph for this function:

Here is the caller graph for this function:

nonconstraint_edge()

bool nonconstraint_edge

(

Agedge_t *

e

)

Definition at line 22 of file class1.c.

References agxget(), constr, E_constr, and mapbool().

Referenced by class1(), and dot_init_edge().

Here is the call graph for this function:

Here is the caller graph for this function:

other_edge()

void other_edge

(

Agedge_t *

e

)

Definition at line 116 of file fastgr.c.

References agtail, elist_append, and ND_other.

Referenced by class2(), and map_path().

Here is the caller graph for this function:

portcmp()

int portcmp	(	port	p0,
		port	p1
	)

Definition at line 128 of file dotsplines.c.

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

Referenced by bothdowncandidates(), bothupcandidates(), dot_splines_(), and edgecmp().

Here is the caller graph for this function:

ports_eq()

int ports_eq	(	edge_t *	e,
		edge_t *	f
	)

Definition at line 1024 of file position.c.

References ED_head_port, and ED_tail_port.

Referenced by class2(), expand_leaves(), map_path(), and mergeable().

Here is the caller graph for this function:

rank1()

void rank1

(

graph_t *

g

)

Definition at line 453 of file rank.c.

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

Referenced by dot1_rank().

Here is the call graph for this function:

Here is the caller graph for this function:

rec_reset_vlists()

void rec_reset_vlists

(

Agraph_t *

g

)

Definition at line 930 of file mincross.c.

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

Referenced by cleanup2(), flat_edges(), and rec_reset_vlists().

Here is the call graph for this function:

Here is the caller graph for this function:

rec_save_vlists()

void rec_save_vlists

(

Agraph_t *

g

)

Definition at line 922 of file mincross.c.

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

Referenced by flat_edges(), and rec_save_vlists().

Here is the call graph for this function:

Here is the caller graph for this function:

reverse_edge()

void reverse_edge

(

Agedge_t *

e

)

Definition at line 22 of file acyclic.c.

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

Referenced by dfs(), and minmax_edges().

Here is the call graph for this function:

Here is the caller graph for this function:

safe_other_edge()

void safe_other_edge

(

Agedge_t *

e

)

Definition at line 121 of file fastgr.c.

References agtail, ND_other, and safe_list_append().

Referenced by interclexp().

Here is the call graph for this function:

Here is the caller graph for this function:

save_vlist()

void save_vlist

(

Agraph_t *

g

)

Definition at line 913 of file mincross.c.

References GD_maxrank, GD_minrank, GD_rank, and GD_rankleader.

Referenced by mincross_clust(), and rec_save_vlists().

Here is the caller graph for this function:

virtual_edge()

Agedge_t * virtual_edge	(	Agnode_t *	u,
		Agnode_t *	v,
		Agedge_t *	orig
	)

Definition at line 170 of file fastgr.c.

References fast_edge(), and new_virtual_edge().

Referenced by build_skeleton(), class1(), flat_node(), make_chain(), map_path(), mergevirtual(), minmax_edges2(), and reverse_edge().

Here is the call graph for this function:

Here is the caller graph for this function:

virtual_node()

Agnode_t * virtual_node

(

Agraph_t *

g

)

Definition at line 200 of file fastgr.c.

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

Referenced by build_skeleton(), clone_vn(), connectGraph(), interclust1(), label_vnode(), make_edge_pairs(), make_lrvn(), make_vn_slot(), and plain_vnode().

Here is the call graph for this function:

Here is the caller graph for this function:

virtual_weight()

void virtual_weight

(

Agedge_t *

e

)

Definition at line 1720 of file mincross.c.

References agerrorf(), aghead, agtail, ED_weight, endpoint_class(), graphviz_exit(), and table.

Referenced by make_chain().

Here is the call graph for this function:

Here is the caller graph for this function:

zapinlist()

void zapinlist	(	elist *	L,
		Agedge_t *	e
	)

Definition at line 96 of file fastgr.c.

References L, and NULL.

Referenced by delete_fast_edge(), delete_flat_edge(), and expand_leaves().

Here is the caller graph for this function: