Package gen.lib.dotgen

Class mincross__c

java.lang.Object

gen.lib.dotgen.mincross__c

public class mincross__c
extends Object

Field Summary

Fields

Modifier and Type	Field	Description
static CFunction	nodeposcmpf
static CFunction	ordercmpf

Constructor Summary

Constructors

Constructor	Description
mincross__c()

Method Summary

Modifier and Type	Method	Description
static void	allocate_ranks(ST_Agraph_s g)
static Object	balance(Object... arg_)
static void	build_ranks(ST_Agraph_s g, int pass)
static void	cleanup2(ST_Agraph_s g, int nc)
static boolean	constraining_flat_edge(ST_Agraph_s g, ST_Agnode_s v, ST_Agedge_s e)
static void	dot_mincross(ST_Agraph_s g, boolean doBalance)
static int	endpoint_class(ST_Agnode_s n)
static void	enqueue_neighbors(ST_nodequeue q, ST_Agnode_s n0, int pass)
static void	exchange(ST_Agnode_s v, ST_Agnode_s w)
static void	fillRanks(ST_Agraph_s g)
static void	flat_breakcycles(ST_Agraph_s g)
static boolean	flat_mval(ST_Agnode_s n)
static void	flat_reorder(ST_Agraph_s g)
static void	flat_rev(ST_Agraph_s g, ST_Agedge_s e)
static void	flat_search(ST_Agraph_s g, ST_Agnode_s v)
static void	free_matrix(ST_adjmatrix_t p)
static ST_Agnode_s	furthestnode(ST_Agraph_s g, ST_Agnode_s v, int dir)
static int	in_cross(ST_Agnode_s v, ST_Agnode_s w)
static void	init_mccomp(ST_Agraph_s g, int c)
static void	init_mincross(ST_Agraph_s g)
static boolean	inside_cluster(ST_Agraph_s g, ST_Agnode_s v)
static void	install_in_rank(ST_Agraph_s g, ST_Agnode_s n)
static boolean	is_a_normal_node_of(ST_Agraph_s g, ST_Agnode_s v)
static boolean	is_a_vnode_of_an_edge_of(ST_Agraph_s g, ST_Agnode_s v)
static boolean	left2right(ST_Agraph_s g, ST_Agnode_s v, ST_Agnode_s w)
static int	local_cross(ST_elist l, int dir)
static boolean	medians(ST_Agraph_s g, int r0, int r1)
static void	merge_components(ST_Agraph_s g)
static void	merge2(ST_Agraph_s g)
static int	mincross_(ST_Agraph_s g, int startpass, int endpass, boolean doBalance)
static int	mincross_clust(ST_Agraph_s par, ST_Agraph_s g, boolean doBalance)
static void	mincross_options(ST_Agraph_s g)
static void	mincross_step(ST_Agraph_s g, int pass)
static int	ncross(ST_Agraph_s g)
static ST_Agnode_s	neighbor(ST_Agnode_s v, int dir)
static ST_adjmatrix_t	new_matrix(int i, int j)
static Object	nodeposcmpf(CArrayOfStar<ST_Agnode_s> n0, CArrayOfStar<ST_Agnode_s> n1)
static int	ordercmpf(Integer i0, Integer i1)
static void	ordered_edges(ST_Agraph_s g)
static int	out_cross(ST_Agnode_s v, ST_Agnode_s w)
static int	postorder(ST_Agraph_s g, ST_Agnode_s v, CArrayOfStar<ST_Agnode_s> list, int r)
static int	rcross(ST_Agraph_s g, int r)
static ST_Agraph_s	realFillRanks(ST_Agraph_s g, int[] rnks, int rnks_sz, ST_Agraph_s sg)
static void	rec_reset_vlists(ST_Agraph_s g)
static void	rec_save_vlists(ST_Agraph_s g)
static void	reorder(ST_Agraph_s g, int r, boolean reverse, boolean hasfixed)
static void	restore_best(ST_Agraph_s g)
static void	save_best(ST_Agraph_s g)
static void	save_vlist(ST_Agraph_s g)
static void	transpose(ST_Agraph_s g, boolean reverse)
static int	transpose_step(ST_Agraph_s g, int r, boolean reverse)
static void	virtual_weight(ST_Agedge_s e)

Methods inherited from class java.lang.Object

clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Field Details

ordercmpf

public static CFunction ordercmpf

nodeposcmpf

public static CFunction nodeposcmpf

Constructor Details

mincross__c

public mincross__c()

Method Details

dot_mincross

public static void dot_mincross(ST_Agraph_s g,
 boolean doBalance)

new_matrix

public static ST_adjmatrix_t new_matrix(int i,
 int j)

free_matrix

public static void free_matrix(ST_adjmatrix_t p)

init_mccomp

public static void init_mccomp(ST_Agraph_s g,
 int c)

ordered_edges

public static void ordered_edges(ST_Agraph_s g)

mincross_clust

public static int mincross_clust(ST_Agraph_s par,
 ST_Agraph_s g,
 boolean doBalance)

left2right

public static boolean left2right(ST_Agraph_s g,
 ST_Agnode_s v,
 ST_Agnode_s w)

in_cross

public static int in_cross(ST_Agnode_s v,
 ST_Agnode_s w)

out_cross

public static int out_cross(ST_Agnode_s v,
 ST_Agnode_s w)

exchange

public static void exchange(ST_Agnode_s v,
 ST_Agnode_s w)

balance

public static Object balance(Object... arg_)

transpose_step

public static int transpose_step(ST_Agraph_s g,
 int r,
 boolean reverse)

transpose

public static void transpose(ST_Agraph_s g,
 boolean reverse)

mincross_

public static int mincross_(ST_Agraph_s g,
 int startpass,
 int endpass,
 boolean doBalance)

restore_best

public static void restore_best(ST_Agraph_s g)

save_best

public static void save_best(ST_Agraph_s g)

merge_components

public static void merge_components(ST_Agraph_s g)

merge2

public static void merge2(ST_Agraph_s g)

cleanup2

public static void cleanup2(ST_Agraph_s g,
 int nc)

neighbor

public static ST_Agnode_s neighbor(ST_Agnode_s v,
 int dir)

is_a_normal_node_of

public static boolean is_a_normal_node_of(ST_Agraph_s g,
 ST_Agnode_s v)

is_a_vnode_of_an_edge_of

public static boolean is_a_vnode_of_an_edge_of(ST_Agraph_s g,
 ST_Agnode_s v)

inside_cluster

public static boolean inside_cluster(ST_Agraph_s g,
 ST_Agnode_s v)

furthestnode

public static ST_Agnode_s furthestnode(ST_Agraph_s g,
 ST_Agnode_s v,
 int dir)

save_vlist

public static void save_vlist(ST_Agraph_s g)

rec_save_vlists

public static void rec_save_vlists(ST_Agraph_s g)

rec_reset_vlists

public static void rec_reset_vlists(ST_Agraph_s g)

realFillRanks

public static ST_Agraph_s realFillRanks(ST_Agraph_s g,
 int[] rnks,
 int rnks_sz,
 ST_Agraph_s sg)

fillRanks

public static void fillRanks(ST_Agraph_s g)

init_mincross

public static void init_mincross(ST_Agraph_s g)

flat_rev

public static void flat_rev(ST_Agraph_s g,
 ST_Agedge_s e)

flat_search

public static void flat_search(ST_Agraph_s g,
 ST_Agnode_s v)

flat_breakcycles

public static void flat_breakcycles(ST_Agraph_s g)

allocate_ranks

public static void allocate_ranks(ST_Agraph_s g)

install_in_rank

public static void install_in_rank(ST_Agraph_s g,
 ST_Agnode_s n)

build_ranks

public static void build_ranks(ST_Agraph_s g,
 int pass)

enqueue_neighbors

public static void enqueue_neighbors(ST_nodequeue q,
 ST_Agnode_s n0,
 int pass)

constraining_flat_edge

public static boolean constraining_flat_edge(ST_Agraph_s g,
 ST_Agnode_s v,
 ST_Agedge_s e)

postorder

public static int postorder(ST_Agraph_s g,
 ST_Agnode_s v,
 CArrayOfStar<ST_Agnode_s> list,
 int r)

flat_reorder

public static void flat_reorder(ST_Agraph_s g)

reorder

public static void reorder(ST_Agraph_s g,
 int r,
 boolean reverse,
 boolean hasfixed)

mincross_step

public static void mincross_step(ST_Agraph_s g,
 int pass)

local_cross

public static int local_cross(ST_elist l,
 int dir)

rcross

public static int rcross(ST_Agraph_s g,
 int r)

ncross

public static int ncross(ST_Agraph_s g)

ordercmpf

public static int ordercmpf(Integer i0,
 Integer i1)

flat_mval

public static boolean flat_mval(ST_Agnode_s n)

medians

public static boolean medians(ST_Agraph_s g,
 int r0,
 int r1)

nodeposcmpf

public static Object nodeposcmpf(CArrayOfStar<ST_Agnode_s> n0,
 CArrayOfStar<ST_Agnode_s> n1)

endpoint_class

public static int endpoint_class(ST_Agnode_s n)

virtual_weight

public static void virtual_weight(ST_Agedge_s e)

mincross_options

public static void mincross_options(ST_Agraph_s g)