gen.lib.dotgen

Class mincross__c

java.lang.Object

gen.lib.dotgen.mincross__c

public class mincross__c
extends Object

Constructor Summary

Constructors

Constructor and Description
mincross__c()

Method Summary

Modifier and Type	Method and Description
static Object	add_point(Object... arg)
static __struct__<pointf>	add_pointf(__struct__<pointf> p, __struct__<pointf> q)
static void	allocate_ranks(Agraph_s g)
static Object	balance(Object... arg)
static Object	balanceNodes(Object... arg)
static Object	betweenclust(Object... arg)
static Object	box_bb(Object... arg)
static Object	box_contains(Object... arg)
static Object	box_intersect(Object... arg)
static Object	box_overlap(Object... arg)
static Object	boxf_bb(Object... arg)
static Object	boxf_contains(Object... arg)
static Object	boxf_intersect(Object... arg)
static Object	boxf_overlap(Object... arg)
static __struct__<boxf>	boxfof(double llx, double lly, double urx, double ury)
static Object	boxof(Object... arg)
static void	build_ranks(Agraph_s g, int pass)
static void	cleanup2(Agraph_s g, int nc)
static boolean	constraining_flat_edge(Agraph_s g, Agnode_s v, Agedge_s e)
static Object	do_ordering_for_nodes(Object... arg)
static Object	do_ordering_node(Object... arg)
static Object	do_ordering(Object... arg)
static void	dot_mincross(Agraph_s g, boolean doBalance)
static Object	edgeidcmpf(Object... arg)
static int	endpoint_class(Agnode_s n)
static void	enqueue_neighbors(nodequeue q, Agnode_s n0, int pass)
static Object	exch_xy(Object... arg)
static Object	exch_xyf(Object... arg)
static void	exchange(Agnode_s v, Agnode_s w)
static void	fillRanks(Agraph_s g)
static void	flat_breakcycles(Agraph_s g)
static boolean	flat_mval(Agnode_s n)
static void	flat_reorder(Agraph_s g)
static void	flat_rev(Agraph_s g, Agedge_s e)
static void	flat_search(Agraph_s g, Agnode_s v)
static void	free_matrix(adjmatrix_t p)
static Agnode_s	furthestnode(Agraph_s g, Agnode_s v, int dir)
static Object	gd_maxrank(Object... arg)
static Object	gd_minrank(Object... arg)
static Object	gd_rank(Object... arg)
static int	in_cross(Agnode_s v, Agnode_s w)
static void	init_mccomp(Agraph_s g, int c)
static void	init_mincross(Agraph_s g)
static boolean	inside_cluster(Agraph_s g, Agnode_s v)
static void	install_in_rank(Agraph_s g, Agnode_s n)
static Object	interpolate_pointf(Object... arg)
static boolean	is_a_normal_node_of(Agraph_s g, Agnode_s v)
static boolean	is_a_vnode_of_an_edge_of(Agraph_s g, Agnode_s v)
static boolean	left2right(Agraph_s g, Agnode_s v, Agnode_s w)
static int	local_cross(__struct__<elist> l, int dir)
static boolean	medians(Agraph_s g, int r0, int r1)
static void	merge_components(Agraph_s g)
static void	merge2(Agraph_s g)
static Object	mid_point(Object... arg)
static Object	mid_pointf(Object... arg)
static int	mincross_(Agraph_s g, int startpass, int endpass, boolean doBalance)
static int	mincross_clust(Agraph_s par, Agraph_s g, boolean doBalance)
static void	mincross_options(Agraph_s g)
static void	mincross_step(Agraph_s g, int pass)
static int	ncross(Agraph_s g)
static Object	nd_order(Object... arg)
static Agnode_s	neighbor(Agnode_s v, int dir)
static adjmatrix_t	new_matrix(int i, int j)
static Object	nodeposcmpf(__ptr__ n0, __ptr__ n1)
static int	ordercmpf(__ptr__ i0, __ptr__ i1)
static void	ordered_edges(Agraph_s g)
static int	out_cross(Agnode_s v, Agnode_s w)
static Object	perp(Object... arg)
static __struct__<pointf>	pointfof(double x, double y)
static Object	pointof(Object... arg)
static int	postorder(Agraph_s g, Agnode_s v, __ptr__ list, int r)
static int	rcross(Agraph_s g, int r)
static Agraph_s	realFillRanks(Agraph_s g, __ptr__ rnks, int rnks_sz, Agraph_s sg)
static void	rec_reset_vlists(Agraph_s g)
static void	rec_save_vlists(Agraph_s g)
static void	reorder(Agraph_s g, int r, boolean reverse, boolean hasfixed)
static void	restore_best(Agraph_s g)
static void	save_best(Agraph_s g)
static void	save_vlist(Agraph_s g)
static Object	scale(Object... arg)
static Object	sub_point(Object... arg)
static Object	sub_pointf(Object... arg)
static int	transpose_step(Agraph_s g, int r, boolean reverse)
static void	transpose(Agraph_s g, boolean reverse)
static void	virtual_weight(Agedge_s e)

Methods inherited from class java.lang.Object

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

Constructor Detail

mincross__c

public mincross__c()

Method Detail

pointof

public static Object pointof(Object... arg)

pointfof

public static __struct__<pointf> pointfof(double x,
                                          double y)

boxof

public static Object boxof(Object... arg)

boxfof

public static __struct__<boxf> boxfof(double llx,
                                      double lly,
                                      double urx,
                                      double ury)

add_point

public static Object add_point(Object... arg)

add_pointf

public static __struct__<pointf> add_pointf(__struct__<pointf> p,
                                            __struct__<pointf> q)

sub_point

public static Object sub_point(Object... arg)

sub_pointf

public static Object sub_pointf(Object... arg)

mid_point

public static Object mid_point(Object... arg)

mid_pointf

public static Object mid_pointf(Object... arg)

interpolate_pointf

public static Object interpolate_pointf(Object... arg)

exch_xy

public static Object exch_xy(Object... arg)

exch_xyf

public static Object exch_xyf(Object... arg)

box_bb

public static Object box_bb(Object... arg)

boxf_bb

public static Object boxf_bb(Object... arg)

box_intersect

public static Object box_intersect(Object... arg)

boxf_intersect

public static Object boxf_intersect(Object... arg)

box_overlap

public static Object box_overlap(Object... arg)

boxf_overlap

public static Object boxf_overlap(Object... arg)

box_contains

public static Object box_contains(Object... arg)

boxf_contains

public static Object boxf_contains(Object... arg)

perp

public static Object perp(Object... arg)

scale

public static Object scale(Object... arg)

gd_minrank

public static Object gd_minrank(Object... arg)

gd_maxrank

public static Object gd_maxrank(Object... arg)

gd_rank

public static Object gd_rank(Object... arg)

nd_order

public static Object nd_order(Object... arg)

dot_mincross

public static void dot_mincross(Agraph_s g,
                                boolean doBalance)

new_matrix

public static adjmatrix_t new_matrix(int i,
                                     int j)

free_matrix

public static void free_matrix(adjmatrix_t p)

init_mccomp

public static void init_mccomp(Agraph_s g,
                               int c)

betweenclust

public static Object betweenclust(Object... arg)

do_ordering_node

public static Object do_ordering_node(Object... arg)

do_ordering

public static Object do_ordering(Object... arg)

do_ordering_for_nodes

public static Object do_ordering_for_nodes(Object... arg)

ordered_edges

public static void ordered_edges(Agraph_s g)

mincross_clust

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

left2right

public static boolean left2right(Agraph_s g,
                                 Agnode_s v,
                                 Agnode_s w)

in_cross

public static int in_cross(Agnode_s v,
                           Agnode_s w)

out_cross

public static int out_cross(Agnode_s v,
                            Agnode_s w)

exchange

public static void exchange(Agnode_s v,
                            Agnode_s w)

balanceNodes

public static Object balanceNodes(Object... arg)

balance

public static Object balance(Object... arg)

transpose_step

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

transpose

public static void transpose(Agraph_s g,
                             boolean reverse)

mincross_

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

restore_best

public static void restore_best(Agraph_s g)

save_best

public static void save_best(Agraph_s g)

merge_components

public static void merge_components(Agraph_s g)

merge2

public static void merge2(Agraph_s g)

cleanup2

public static void cleanup2(Agraph_s g,
                            int nc)

neighbor

public static Agnode_s neighbor(Agnode_s v,
                                int dir)

is_a_normal_node_of

public static boolean is_a_normal_node_of(Agraph_s g,
                                          Agnode_s v)

is_a_vnode_of_an_edge_of

public static boolean is_a_vnode_of_an_edge_of(Agraph_s g,
                                               Agnode_s v)

inside_cluster

public static boolean inside_cluster(Agraph_s g,
                                     Agnode_s v)

furthestnode

public static Agnode_s furthestnode(Agraph_s g,
                                    Agnode_s v,
                                    int dir)

save_vlist

public static void save_vlist(Agraph_s g)

rec_save_vlists

public static void rec_save_vlists(Agraph_s g)

rec_reset_vlists

public static void rec_reset_vlists(Agraph_s g)

realFillRanks

public static Agraph_s realFillRanks(Agraph_s g,
                                     __ptr__ rnks,
                                     int rnks_sz,
                                     Agraph_s sg)

fillRanks

public static void fillRanks(Agraph_s g)

init_mincross

public static void init_mincross(Agraph_s g)

flat_rev

public static void flat_rev(Agraph_s g,
                            Agedge_s e)

flat_search

public static void flat_search(Agraph_s g,
                               Agnode_s v)

flat_breakcycles

public static void flat_breakcycles(Agraph_s g)

allocate_ranks

public static void allocate_ranks(Agraph_s g)

install_in_rank

public static void install_in_rank(Agraph_s g,
                                   Agnode_s n)

build_ranks

public static void build_ranks(Agraph_s g,
                               int pass)

enqueue_neighbors

public static void enqueue_neighbors(nodequeue q,
                                     Agnode_s n0,
                                     int pass)

constraining_flat_edge

public static boolean constraining_flat_edge(Agraph_s g,
                                             Agnode_s v,
                                             Agedge_s e)

postorder

public static int postorder(Agraph_s g,
                            Agnode_s v,
                            __ptr__ list,
                            int r)

flat_reorder

public static void flat_reorder(Agraph_s g)

reorder

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

mincross_step

public static void mincross_step(Agraph_s g,
                                 int pass)

local_cross

public static int local_cross(__struct__<elist> l,
                              int dir)

rcross

public static int rcross(Agraph_s g,
                         int r)

ncross

public static int ncross(Agraph_s g)

ordercmpf

public static int ordercmpf(__ptr__ i0,
                            __ptr__ i1)

flat_mval

public static boolean flat_mval(Agnode_s n)

medians

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

nodeposcmpf

public static Object nodeposcmpf(__ptr__ n0,
                                 __ptr__ n1)

edgeidcmpf

public static Object edgeidcmpf(Object... arg)

endpoint_class

public static int endpoint_class(Agnode_s n)

virtual_weight

public static void virtual_weight(Agedge_s e)

mincross_options

public static void mincross_options(Agraph_s g)