Uses of Class
gen.annotation.Difficult

Packages that use Difficult

Package	Description
gen.lib.cgraph
gen.lib.common
gen.lib.dotgen

Uses of Difficult in gen.lib.cgraph

Methods in gen.lib.cgraph with annotations of type Difficult

Modifier and Type	Method	Description
static void	attr__c.addattr(ST_Agraph_s g, ST_Agobj_s obj, ST_Agsym_s sym)
static int	graph__c.agdegree(ST_Agraph_s g, ST_Agnode_s n, boolean want_in, boolean want_out)
static CString	id__c.idprint(__ptr__ state, int objtype, int id)

Uses of Difficult in gen.lib.common

Methods in gen.lib.common with annotations of type Difficult

Modifier and Type	Method	Description
static void	ns__c.add_tree_edge(ST_Agedge_s e)
static int	ns__c.init_graph(ST_Agraph_s g)
static void	shapes__c.poly_init(ST_Agnode_s n)
static int	ns__c.rank2(ST_Agraph_s g, int balance, int maxiter, int search_size)
static void	labels__c.storeline(ST_GVC_s gvc, ST_textlabel_t lp, CString line, char terminator)
static CString	labels__c.strdup_and_subst_obj0(CString str, ST_Agobj_s obj, int escBackslash)
static void	ns__c.TB_balance()

Uses of Difficult in gen.lib.dotgen

Methods in gen.lib.dotgen with annotations of type Difficult

Modifier and Type	Method	Description
static void	mincross__c.allocate_ranks(ST_Agraph_s g)
static void	mincross__c.build_ranks(ST_Agraph_s g, int pass)
static void	flat__c.checkFlatAdjacent(ST_Agedge_s e)
static void	class2__c.class2(ST_Agraph_s g)
static void	rank__c.cleanup1(ST_Agraph_s g)
static void	decomp__c.decompose(ST_Agraph_s g, int pass)
static void	decomp__c.end_component()
static void	mincross__c.exchange(ST_Agnode_s v, ST_Agnode_s w)
static void	position__c.expand_leaves(ST_Agraph_s g)
static void	mincross__c.flat_breakcycles(ST_Agraph_s g)
static void	fastgr__c.flat_edge(ST_Agraph_s g, ST_Agedge_s e)
static void	flat__c.flat_node(ST_Agedge_s e)
static void	mincross__c.flat_reorder(ST_Agraph_s g)
static void	mincross__c.flat_search(ST_Agraph_s g, ST_Agnode_s v)
static void	mincross__c.init_mccomp(ST_Agraph_s g, int c)
static void	mincross__c.init_mincross(ST_Agraph_s g)
static int	rank__c.make_new_cluster(ST_Agraph_s g, ST_Agraph_s subg)
static ST_Agedge_s	fastgr__c.new_virtual_edge(ST_Agnode_s u, ST_Agnode_s v, ST_Agedge_s orig)
static void	fastgr__c.safe_other_edge(ST_Agedge_s e)
static void	decomp__c.search_component(ST_Agraph_s g, ST_Agnode_s n)
static void	position__c.set_ycoords(ST_Agraph_s g)
static void	dotsplines__c.swap_bezier(CArray<ST_bezier> old, CArray<ST_bezier> new_)