#include "aspect.h"

Include dependency graph for dotprocs.h:

This graph shows which files directly or indirectly include 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 * )

void allocate_ranks ( Agraph_t * )

Referenced by expand_cluster().

void build_ranks	(	Agraph_t *	,
		int
	)

Referenced by expand_cluster().

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 * )

Referenced by reverse_edge().

void delete_fast_node	(	Agraph_t *	,
		Agnode_t *
	)

void delete_flat_edge ( Agedge_t * )

void dot_cleanup ( graph_t * g )

Definition at line 203 of file dotinit.c.

void dot_compoundEdges ( Agraph_t * )

void dot_concentrate ( Agraph_t * )

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 356 of file dotinit.c.

References late_int(), agfindgraphattr, setEdgeType(), ET_SPLINE, dot_init_node_edge(), dot_rank(), aspect_t::badGraph, agerr(), AGWARN, NULL, aspect_t::nextIter, dot_mincross(), dot_position(), aspect_t::nPasses, GD_flags, NEW_RANK, dot_sameports(), dot_splines(), mapbool(), agget(), dot_compoundEdges(), and dotneato_postprocess().

void dot_mincross	(	Agraph_t *	,
		int
	)

Referenced by dot_layout().

void dot_position	(	Agraph_t *	,
		aspect_t *
	)

Referenced by dot_layout().

void dot_rank	(	Agraph_t *	,
		aspect_t *
	)

Referenced by dot_layout().

void dot_sameports ( Agraph_t * )

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 * )

Referenced by dot_layout().

void expand_cluster ( Agraph_t * )

Agedge_t* fast_edge ( Agedge_t * )

Referenced by virtual_edge(), and make_aux_edge().

void fast_node	(	Agraph_t *	,
		Agnode_t *
	)

Referenced by class2(), and virtual_node().

void fast_nodeapp	(	Agnode_t *	,
		Agnode_t *
	)

Agedge_t* find_fast_edge	(	Agnode_t *	,
		Agnode_t *
	)

Referenced by reverse_edge(), and class1().

Agedge_t* find_flat_edge	(	Agnode_t *	,
		Agnode_t *
	)

Referenced by interclexp().

void flat_edge	(	Agraph_t *	,
		Agedge_t *
	)

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

int flat_edges ( Agraph_t * )

Referenced by dot_position().

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

void install_in_rank	(	Agraph_t *	,
		Agnode_t *
	)

Referenced by install_cluster(), and build_ranks().

int is_cluster ( Agraph_t * )

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

Referenced by nonconstraint_edge().

void mark_clusters ( Agraph_t * )

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, 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
	)

void merge_oneway	(	Agedge_t *	,
		Agedge_t *
	)

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 ED_label, ports_eq(), TRUE, and FALSE.

Referenced by class2(), and interclexp().

int ncross ( Agraph_t * )

Referenced by build_ranks().

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

Referenced by virtual_edge(), and flat_rev().

int nonconstraint_edge ( Agedge_t * )

void other_edge ( Agedge_t * )

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 1173 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 * )

Referenced by flat_edges(), and rec_reset_vlists().

void rec_save_vlists ( Agraph_t * )

Referenced by flat_edges(), and rec_save_vlists().

void reverse_edge ( Agedge_t * )

void safe_other_edge ( Agedge_t * )

Referenced by interclexp().

void save_vlist ( Agraph_t * )

Referenced by rec_save_vlists().

void unmerge_oneway ( Agedge_t * )

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

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

Agnode_t* virtual_node ( Agraph_t * )

Referenced by nonconstraint_edge(), and build_skeleton().

void virtual_weight ( Agedge_t * )

void zapinlist	(	elist *	,
		Agedge_t *
	)

Referenced by delete_fast_edge(), and delete_flat_edge().

Functions

Function Documentation