lib/dotgen/mincross.c File Reference

#include "dot.h"

Include dependency graph for mincross.c:

Go to the source code of this file.

Defines
#define	MARK(v)   (ND_mark(v))
#define	saveorder(v)   (ND_coord(v)).x
#define	flatindex(v)   ND_low(v)
#define	ELT(M, i, j)   (M->data[((i)*M->ncols)+(j)])
#define	VAL(node, port)   (MC_SCALE * ND_order(node) + (port).order)
#define	ORDINARY   0
#define	SINGLETON   1
#define	VIRTUALNODE   2
#define	NTYPES   3
#define	C_EE   1
#define	C_VS   2
#define	C_SS   2
#define	C_VV   4
Functions
void	dot_mincross (graph_t *g, int doBalance)
void	save_vlist (graph_t *g)
void	rec_save_vlists (graph_t *g)
void	rec_reset_vlists (graph_t *g)
void	flat_rev (Agraph_t *g, Agedge_t *e)
void	allocate_ranks (graph_t *g)
void	install_in_rank (graph_t *g, node_t *n)
void	build_ranks (graph_t *g, int pass)
void	enqueue_neighbors (nodequeue *q, node_t *n0, int pass)
int	ncross (graph_t *g)
void	virtual_weight (edge_t *e)
Variables
static int	GlobalMaxRank

---

Define Documentation

#define C_EE   1

Definition at line 1624 of file mincross.c.

#define C_SS   2

Definition at line 1626 of file mincross.c.

#define C_VS   2

Definition at line 1625 of file mincross.c.

#define C_VV   4

Definition at line 1627 of file mincross.c.

#define ELT	(		M,
			i,
			j
	)		(M->data[((i)*M->ncols)+(j)])

Definition at line 124 of file mincross.c.

#define flatindex

(

v

)

ND_low(v)

Definition at line 27 of file mincross.c.

#define MARK

(

v

)

(ND_mark(v))

Definition at line 25 of file mincross.c.

Referenced by build_ranks(), and enqueue_neighbors().

#define NTYPES   3

Definition at line 1622 of file mincross.c.

#define ORDINARY   0

Definition at line 1619 of file mincross.c.

#define saveorder

(

v

)

(ND_coord(v)).x

Definition at line 26 of file mincross.c.

#define SINGLETON   1

Definition at line 1620 of file mincross.c.

#define VAL	(		node,
			port
	)		(MC_SCALE * ND_order(node) + (port).order)

Definition at line 1548 of file mincross.c.

#define VIRTUALNODE   2

Definition at line 1621 of file mincross.c.

---

Function Documentation

void allocate_ranks

(

graph_t *

g

)

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	(	graph_t *	g,
		int	pass
	)

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 dot_mincross	(	graph_t *	g,
		int	doBalance
	)

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 enqueue_neighbors	(	nodequeue *	q,
		node_t *	n0,
		int	pass
	)

Definition at line 1192 of file mincross.c.

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

Referenced by install_cluster(), and build_ranks().

void flat_rev	(	Agraph_t *	g,
		Agedge_t *	e
	)

Definition at line 950 of file mincross.c.

References ND_flat_out, aghead, NULL, agtail, merge_oneway(), ED_to_virt, ED_edge_type, FLATORDER, ED_to_orig, elist_append, ND_other, new_virtual_edge(), REVERSED, ED_label, and flat_edge().

void install_in_rank	(	graph_t *	g,
		node_t *	n
	)

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 ncross

(

graph_t *

g

)

Definition at line 1485 of file mincross.c.

References GD_minrank, GD_maxrank, GD_rank, and TRUE.

Referenced by build_ranks().

void rec_reset_vlists

(

graph_t *

g

)

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

(

graph_t *

g

)

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 save_vlist

(

graph_t *

g

)

Definition at line 809 of file mincross.c.

References GD_rankleader, GD_minrank, GD_maxrank, and GD_rank.

Referenced by rec_save_vlists().

void virtual_weight

(

edge_t *

e

)

Definition at line 1644 of file mincross.c.

References agtail, aghead, and ED_weight.

---

Variable Documentation

int GlobalMaxRank

Definition at line 61 of file mincross.c.