public class mincross__c
extends java.lang.Object
Constructor and Description |
---|
mincross__c() |
Modifier and Type | Method and Description |
---|---|
static java.lang.Object |
add_point(java.lang.Object... arg) |
static ST_pointf |
add_pointf(ST_pointf p,
ST_pointf q) |
static void |
allocate_ranks(ST_Agraph_s g) |
static java.lang.Object |
balance(java.lang.Object... arg) |
static java.lang.Object |
balanceNodes(java.lang.Object... arg) |
static java.lang.Object |
betweenclust(java.lang.Object... arg) |
static java.lang.Object |
box_bb(java.lang.Object... arg) |
static java.lang.Object |
box_contains(java.lang.Object... arg) |
static java.lang.Object |
box_intersect(java.lang.Object... arg) |
static java.lang.Object |
box_overlap(java.lang.Object... arg) |
static java.lang.Object |
boxf_bb(java.lang.Object... arg) |
static java.lang.Object |
boxf_contains(java.lang.Object... arg) |
static java.lang.Object |
boxf_intersect(java.lang.Object... arg) |
static java.lang.Object |
boxf_overlap(java.lang.Object... arg) |
static java.lang.Object |
boxof(java.lang.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 java.lang.Object |
do_ordering_for_nodes(java.lang.Object... arg) |
static java.lang.Object |
do_ordering_node(java.lang.Object... arg) |
static java.lang.Object |
do_ordering(java.lang.Object... arg) |
static void |
dot_mincross(ST_Agraph_s g,
boolean doBalance) |
static java.lang.Object |
edgeidcmpf(java.lang.Object... arg) |
static int |
endpoint_class(ST_Agnode_s n) |
static void |
enqueue_neighbors(ST_nodequeue q,
ST_Agnode_s n0,
int pass) |
static java.lang.Object |
exch_xy(java.lang.Object... arg) |
static java.lang.Object |
exch_xyf(java.lang.Object... arg) |
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 java.lang.Object |
gd_maxrank(java.lang.Object... arg) |
static java.lang.Object |
gd_minrank(java.lang.Object... arg) |
static java.lang.Object |
gd_rank(java.lang.Object... arg) |
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 java.lang.Object |
interpolate_pointf(java.lang.Object... arg) |
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 java.lang.Object |
mid_point(java.lang.Object... arg) |
static java.lang.Object |
mid_pointf(java.lang.Object... arg) |
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 java.lang.Object |
nd_order(java.lang.Object... arg) |
static ST_Agnode_s |
neighbor(ST_Agnode_s v,
int dir) |
static ST_adjmatrix_t |
new_matrix(int i,
int j) |
static java.lang.Object |
nodeposcmpf(__ptr__ n0,
__ptr__ n1) |
static int |
ordercmpf(__ptr__ i0,
__ptr__ i1) |
static void |
ordered_edges(ST_Agraph_s g) |
static int |
out_cross(ST_Agnode_s v,
ST_Agnode_s w) |
static java.lang.Object |
perp(java.lang.Object... arg) |
static ST_pointf |
pointfof(double x,
double y) |
static java.lang.Object |
pointof(java.lang.Object... arg) |
static int |
postorder(ST_Agraph_s g,
ST_Agnode_s v,
__ptr__ list,
int r) |
static int |
rcross(ST_Agraph_s g,
int r) |
static ST_Agraph_s |
realFillRanks(ST_Agraph_s g,
__ptr__ 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 java.lang.Object |
scale(java.lang.Object... arg) |
static java.lang.Object |
sub_point(java.lang.Object... arg) |
static java.lang.Object |
sub_pointf(java.lang.Object... arg) |
static int |
transpose_step(ST_Agraph_s g,
int r,
boolean reverse) |
static void |
transpose(ST_Agraph_s g,
boolean reverse) |
static void |
virtual_weight(ST_Agedge_s e) |
public static java.lang.Object pointof(java.lang.Object... arg)
public static ST_pointf pointfof(double x, double y)
public static java.lang.Object boxof(java.lang.Object... arg)
public static java.lang.Object add_point(java.lang.Object... arg)
public static java.lang.Object sub_point(java.lang.Object... arg)
public static java.lang.Object sub_pointf(java.lang.Object... arg)
public static java.lang.Object mid_point(java.lang.Object... arg)
public static java.lang.Object mid_pointf(java.lang.Object... arg)
public static java.lang.Object interpolate_pointf(java.lang.Object... arg)
public static java.lang.Object exch_xy(java.lang.Object... arg)
public static java.lang.Object exch_xyf(java.lang.Object... arg)
public static java.lang.Object box_bb(java.lang.Object... arg)
public static java.lang.Object boxf_bb(java.lang.Object... arg)
public static java.lang.Object box_intersect(java.lang.Object... arg)
public static java.lang.Object boxf_intersect(java.lang.Object... arg)
public static java.lang.Object box_overlap(java.lang.Object... arg)
public static java.lang.Object boxf_overlap(java.lang.Object... arg)
public static java.lang.Object box_contains(java.lang.Object... arg)
public static java.lang.Object boxf_contains(java.lang.Object... arg)
public static java.lang.Object perp(java.lang.Object... arg)
public static java.lang.Object scale(java.lang.Object... arg)
public static java.lang.Object gd_minrank(java.lang.Object... arg)
public static java.lang.Object gd_maxrank(java.lang.Object... arg)
public static java.lang.Object gd_rank(java.lang.Object... arg)
public static java.lang.Object nd_order(java.lang.Object... arg)
public static void dot_mincross(ST_Agraph_s g, boolean doBalance)
public static ST_adjmatrix_t new_matrix(int i, int j)
public static void free_matrix(ST_adjmatrix_t p)
public static void init_mccomp(ST_Agraph_s g, int c)
public static java.lang.Object betweenclust(java.lang.Object... arg)
public static java.lang.Object do_ordering_node(java.lang.Object... arg)
public static java.lang.Object do_ordering(java.lang.Object... arg)
public static java.lang.Object do_ordering_for_nodes(java.lang.Object... arg)
public static void ordered_edges(ST_Agraph_s g)
public static int mincross_clust(ST_Agraph_s par, ST_Agraph_s g, boolean doBalance)
public static boolean left2right(ST_Agraph_s g, ST_Agnode_s v, ST_Agnode_s w)
public static int in_cross(ST_Agnode_s v, ST_Agnode_s w)
public static int out_cross(ST_Agnode_s v, ST_Agnode_s w)
public static void exchange(ST_Agnode_s v, ST_Agnode_s w)
public static java.lang.Object balanceNodes(java.lang.Object... arg)
public static java.lang.Object balance(java.lang.Object... arg)
public static int transpose_step(ST_Agraph_s g, int r, boolean reverse)
public static void transpose(ST_Agraph_s g, boolean reverse)
public static int mincross_(ST_Agraph_s g, int startpass, int endpass, boolean doBalance)
public static void restore_best(ST_Agraph_s g)
public static void save_best(ST_Agraph_s g)
public static void merge_components(ST_Agraph_s g)
public static void merge2(ST_Agraph_s g)
public static void cleanup2(ST_Agraph_s g, int nc)
public static ST_Agnode_s neighbor(ST_Agnode_s v, int dir)
public static boolean is_a_normal_node_of(ST_Agraph_s g, ST_Agnode_s v)
public static boolean is_a_vnode_of_an_edge_of(ST_Agraph_s g, ST_Agnode_s v)
public static boolean inside_cluster(ST_Agraph_s g, ST_Agnode_s v)
public static ST_Agnode_s furthestnode(ST_Agraph_s g, ST_Agnode_s v, int dir)
public static void save_vlist(ST_Agraph_s g)
public static void rec_save_vlists(ST_Agraph_s g)
public static void rec_reset_vlists(ST_Agraph_s g)
public static ST_Agraph_s realFillRanks(ST_Agraph_s g, __ptr__ rnks, int rnks_sz, ST_Agraph_s sg)
public static void fillRanks(ST_Agraph_s g)
public static void init_mincross(ST_Agraph_s g)
public static void flat_rev(ST_Agraph_s g, ST_Agedge_s e)
public static void flat_search(ST_Agraph_s g, ST_Agnode_s v)
public static void flat_breakcycles(ST_Agraph_s g)
public static void allocate_ranks(ST_Agraph_s g)
public static void install_in_rank(ST_Agraph_s g, ST_Agnode_s n)
public static void build_ranks(ST_Agraph_s g, int pass)
public static void enqueue_neighbors(ST_nodequeue q, ST_Agnode_s n0, int pass)
public static boolean constraining_flat_edge(ST_Agraph_s g, ST_Agnode_s v, ST_Agedge_s e)
public static int postorder(ST_Agraph_s g, ST_Agnode_s v, __ptr__ list, int r)
public static void flat_reorder(ST_Agraph_s g)
public static void reorder(ST_Agraph_s g, int r, boolean reverse, boolean hasfixed)
public static void mincross_step(ST_Agraph_s g, int pass)
public static int local_cross(ST_elist l, int dir)
public static int rcross(ST_Agraph_s g, int r)
public static int ncross(ST_Agraph_s g)
public static boolean flat_mval(ST_Agnode_s n)
public static boolean medians(ST_Agraph_s g, int r0, int r1)
public static java.lang.Object edgeidcmpf(java.lang.Object... arg)
public static int endpoint_class(ST_Agnode_s n)
public static void virtual_weight(ST_Agedge_s e)
public static void mincross_options(ST_Agraph_s g)
Copyright © 2020. All Rights Reserved.