Package gen.lib.common

Class ns__c

java.lang.Object

gen.lib.common.ns__c

public class ns__c
extends Object

Constructor Summary

Constructors

Constructor	Description
ns__c()

Method Summary

Modifier and Type	Method	Description
static void	add_tree_edge(Globals zz, ST_Agedge_s e)
static void	dfs_cutval(ST_Agnode_s v, ST_Agedge_s par)
static void	dfs_enter_inedge(Globals zz, ST_Agnode_s v)
static void	dfs_enter_outedge(Globals zz, ST_Agnode_s v)
static int	dfs_range(ST_Agnode_s v, ST_Agedge_s par, int low)
static ST_Agedge_s	enter_edge(Globals zz, ST_Agedge_s e)
static void	exchange_tree_edges(Globals zz, ST_Agedge_s e, ST_Agedge_s f)
static int	feasible_tree(Globals zz)
static void	freeTreeList(Globals zz, ST_Agraph_s g)
static ST_Agnode_s	incident(ST_Agedge_s e)
static void	init_cutvalues(Globals zz)
static int	init_graph(Globals zz, ST_Agraph_s g)
static void	init_rank(Globals zz)
static ST_Agedge_s	leave_edge(Globals zz)
static void	LR_balance(Globals zz)
static int	rank(Globals zz, ST_Agraph_s g, int balance, int maxiter)
static int	rank2(Globals zz, ST_Agraph_s g, int balance, int maxiter, int search_size)
static void	rerank(ST_Agnode_s v, int delta)
static void	scan_and_normalize(Globals zz)
static void	TB_balance(Globals zz)
static int	tight_tree(Globals zz)
static boolean	treesearch(Globals zz, ST_Agnode_s v)
static ST_Agnode_s	treeupdate(ST_Agnode_s v, ST_Agnode_s w, int cutvalue, boolean dir)
static void	update(Globals zz, ST_Agedge_s e, ST_Agedge_s f)
static void	x_cutval(ST_Agedge_s f)
static int	x_val(ST_Agedge_s e, ST_Agnode_s v, int dir)

Methods inherited from class java.lang.Object

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

Constructor Details

ns__c

public ns__c()

Method Details

add_tree_edge

public static void add_tree_edge(Globals zz,
 ST_Agedge_s e)

exchange_tree_edges

public static void exchange_tree_edges(Globals zz,
 ST_Agedge_s e,
 ST_Agedge_s f)

init_rank

public static void init_rank(Globals zz)

incident

public static ST_Agnode_s incident(ST_Agedge_s e)

leave_edge

public static ST_Agedge_s leave_edge(Globals zz)

dfs_enter_outedge

public static void dfs_enter_outedge(Globals zz,
 ST_Agnode_s v)

dfs_enter_inedge

public static void dfs_enter_inedge(Globals zz,
 ST_Agnode_s v)

enter_edge

public static ST_Agedge_s enter_edge(Globals zz,
 ST_Agedge_s e)

treesearch

public static boolean treesearch(Globals zz,
 ST_Agnode_s v)

tight_tree

public static int tight_tree(Globals zz)

init_cutvalues

public static void init_cutvalues(Globals zz)

feasible_tree

public static int feasible_tree(Globals zz)

treeupdate

public static ST_Agnode_s treeupdate(ST_Agnode_s v,
 ST_Agnode_s w,
 int cutvalue,
 boolean dir)

rerank

public static void rerank(ST_Agnode_s v,
 int delta)

update

public static void update(Globals zz,
 ST_Agedge_s e,
 ST_Agedge_s f)

scan_and_normalize

public static void scan_and_normalize(Globals zz)

freeTreeList

public static void freeTreeList(Globals zz,
 ST_Agraph_s g)

LR_balance

public static void LR_balance(Globals zz)

TB_balance

public static void TB_balance(Globals zz)

init_graph

public static int init_graph(Globals zz,
 ST_Agraph_s g)

rank2

public static int rank2(Globals zz,
 ST_Agraph_s g,
 int balance,
 int maxiter,
 int search_size)

rank

public static int rank(Globals zz,
 ST_Agraph_s g,
 int balance,
 int maxiter)

x_cutval

public static void x_cutval(ST_Agedge_s f)

x_val

public static int x_val(ST_Agedge_s e,
 ST_Agnode_s v,
 int dir)

dfs_cutval

public static void dfs_cutval(ST_Agnode_s v,
 ST_Agedge_s par)

dfs_range

public static int dfs_range(ST_Agnode_s v,
 ST_Agedge_s par,
 int low)