Uses of Class
h.ST_Agraph_s
-
Packages that use ST_Agraph_s Package Description gen.lib.cgraph gen.lib.common gen.lib.dotgen gen.lib.gvc gen.lib.pack h net.sourceforge.plantuml.sdot smetana.core -
-
Uses of ST_Agraph_s in gen.lib.cgraph
Methods in gen.lib.cgraph that return ST_Agraph_s Modifier and Type Method Description static ST_Agraph_s
subg__c. agfindsubg_by_id(ST_Agraph_s g, int id)
static ST_Agraph_s
subg__c. agfstsubg(ST_Agraph_s g)
static ST_Agraph_s
subg__c. agnxtsubg(ST_Agraph_s subg)
static ST_Agraph_s
graph__c. agopen(CString name, ST_Agdesc_s desc, ST_Agdisc_s arg_disc)
static ST_Agraph_s
graph__c. agopen1(ST_Agraph_s g)
static ST_Agraph_s
subg__c. agparent(ST_Agraph_s g)
static ST_Agraph_s
obj__c. agraphof(ST_Agobj_s obj)
static ST_Agraph_s
obj__c. agroot(ST_Agobj_s obj)
static ST_Agraph_s
subg__c. agsubg(ST_Agraph_s g, CString name, boolean cflag)
static ST_Agraph_s
subg__c. localsubg(ST_Agraph_s g, int id)
-
Uses of ST_Agraph_s in gen.lib.common
Methods in gen.lib.common with parameters of type ST_Agraph_s Modifier and Type Method Description static ST_cinfo_t
postproc__c. addClusterObj(ST_Agraph_s g, ST_cinfo_t info)
static void
postproc__c. addXLabels(ST_Agraph_s gp)
static int
postproc__c. countClusterLabels(ST_Agraph_s g)
static void
input__c. do_graph_label(ST_Agraph_s sg)
static void
postproc__c. dotneato_postprocess(ST_Agraph_s g)
static ST_pointf
splines__c. edgeMidpoint(ST_Agraph_s g, ST_Agedge_s e)
static int
input__c. findCharset(ST_Agraph_s g)
static void
ns__c. freeTreeList(ST_Agraph_s g)
static boolean
input__c. getdoubles2ptf(ST_Agraph_s g, CString name, ST_pointf result)
static void
input__c. graph_init(ST_Agraph_s g, boolean use_rankdir)
static void
postproc__c. gv_postprocess(ST_Agraph_s g, int allowTranslation)
static CString
utils__c. htmlEntityUTF8(CString s, ST_Agraph_s g)
static int
ns__c. init_graph(ST_Agraph_s g)
static __ptr__
emit__c. init_xdot(ST_Agraph_s g)
static void
postproc__c. place_graph_label(ST_Agraph_s g)
static int
ns__c. rank(ST_Agraph_s g, int balance, int maxiter)
static int
ns__c. rank2(ST_Agraph_s g, int balance, int maxiter, int search_size)
static void
utils__c. setEdgeType(ST_Agraph_s g, int dflt)
static void
input__c. setRatio(ST_Agraph_s g)
static void
postproc__c. translate_bb(ST_Agraph_s g, int rankdir)
static void
postproc__c. translate_drawing(ST_Agraph_s g)
static void
utils__c. updateBB(ST_Agraph_s g, ST_textlabel_t lp)
-
Uses of ST_Agraph_s in gen.lib.dotgen
Methods in gen.lib.dotgen that return ST_Agraph_s Modifier and Type Method Description static ST_Agraph_s
dotsplines__c. cl_bound(ST_Agraph_s g, ST_Agnode_s n, ST_Agnode_s adj)
static ST_Agraph_s
dotinit__c. dot_root(ST_Agobj_s p)
static ST_Agraph_s
mincross__c. realFillRanks(ST_Agraph_s g, int[] rnks, int rnks_sz, ST_Agraph_s sg)
Methods in gen.lib.dotgen with parameters of type ST_Agraph_s Modifier and Type Method Description static void
flat__c. abomination(ST_Agraph_s g)
static void
acyclic__c. acyclic_(ST_Agraph_s g)
static void
position__c. allocate_aux_edges(ST_Agraph_s g)
static void
mincross__c. allocate_ranks(ST_Agraph_s g)
static void
mincross__c. build_ranks(ST_Agraph_s g, int pass)
static void
cluster__c. build_skeleton(ST_Agraph_s g, ST_Agraph_s subg)
static ST_Agraph_s
dotsplines__c. cl_bound(ST_Agraph_s g, ST_Agnode_s n, ST_Agnode_s adj)
static boolean
dotsplines__c. cl_vninside(ST_Agraph_s cl, ST_Agnode_s n)
static void
class1__c. class1_(ST_Agraph_s g)
static void
class2__c. class2(ST_Agraph_s g)
static void
rank__c. cleanup1(ST_Agraph_s g)
static void
mincross__c. cleanup2(ST_Agraph_s g, int nc)
static ST_Agnode_s
cluster__c. clone_vn(ST_Agraph_s g, ST_Agnode_s vn)
static int
position__c. clust_ht(ST_Agraph_s g)
static void
rank__c. cluster_leader(ST_Agraph_s clust)
static void
rank__c. collapse_cluster(ST_Agraph_s g, ST_Agraph_s subg)
static void
rank__c. collapse_sets(ST_Agraph_s rg, ST_Agraph_s g)
static void
position__c. compress_graph(ST_Agraph_s g)
static void
position__c. connectGraph(ST_Agraph_s g)
static boolean
mincross__c. constraining_flat_edge(ST_Agraph_s g, ST_Agnode_s v, ST_Agedge_s e)
static void
position__c. contain_clustnodes(ST_Agraph_s g)
static void
position__c. contain_nodes(ST_Agraph_s g)
static void
position__c. contain_subclust(ST_Agraph_s g)
static void
position__c. create_aux_edges(ST_Agraph_s g)
static void
decomp__c. decompose(ST_Agraph_s g, int pass)
static void
fastgr__c. delete_fast_node(ST_Agraph_s g, ST_Agnode_s n)
static void
dotinit__c. doDot(ST_Agraph_s g)
static void
position__c. dot_compute_bb(ST_Agraph_s g, ST_Agraph_s root)
static void
dotinit__c. dot_init_node_edge(ST_Agraph_s g)
static void
dotinit__c. dot_init_subg(ST_Agraph_s g, ST_Agraph_s droot)
static void
dotinit__c. dot_layout(ST_Agraph_s g)
static void
mincross__c. dot_mincross(ST_Agraph_s g, boolean doBalance)
static void
position__c. dot_position(ST_Agraph_s g, ST_aspect_t asp)
static void
rank__c. dot_rank(ST_Agraph_s g, ST_aspect_t asp)
static void
sameport__c. dot_sameports(ST_Agraph_s g)
static void
dotsplines__c. dot_splines(ST_Agraph_s g)
static void
rank__c. dot1_rank(ST_Agraph_s g, ST_aspect_t asp)
static void
dotinit__c. dotLayout(ST_Agraph_s g)
static void
dotsplines__c. edge_normalize(ST_Agraph_s g)
static void
rank__c. edgelabel_ranks(ST_Agraph_s g)
static void
cluster__c. expand_cluster(ST_Agraph_s subg)
static void
position__c. expand_leaves(ST_Agraph_s g)
static void
rank__c. expand_ranksets(ST_Agraph_s g, ST_aspect_t asp)
static void
fastgr__c. fast_node(ST_Agraph_s g, ST_Agnode_s n)
static void
mincross__c. fillRanks(ST_Agraph_s g)
static ST_Agnode_s
fastgr__c. find_fast_node(ST_Agraph_s g, ST_Agnode_s n)
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 boolean
flat__c. flat_edges(ST_Agraph_s g)
static int
flat__c. flat_limits(ST_Agraph_s g, ST_Agedge_s e)
static void
mincross__c. flat_reorder(ST_Agraph_s g)
static void
mincross__c. flat_rev(ST_Agraph_s g, ST_Agedge_s e)
static void
mincross__c. flat_search(ST_Agraph_s g, ST_Agnode_s v)
static ST_Agnode_s
mincross__c. furthestnode(ST_Agraph_s g, ST_Agnode_s v, int dir)
static void
class2__c. incr_width(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 boolean
mincross__c. inside_cluster(ST_Agraph_s g, ST_Agnode_s v)
static void
cluster__c. install_cluster(ST_Agraph_s g, ST_Agnode_s n, int pass, ST_nodequeue q)
static void
mincross__c. install_in_rank(ST_Agraph_s g, ST_Agnode_s n)
static void
cluster__c. interclexp(ST_Agraph_s subg)
static void
class2__c. interclrep(ST_Agraph_s g, ST_Agedge_s e)
static void
class1__c. interclust1(ST_Agraph_s g, ST_Agnode_s t, ST_Agnode_s h, ST_Agedge_s e)
static boolean
mincross__c. is_a_normal_node_of(ST_Agraph_s g, ST_Agnode_s v)
static boolean
mincross__c. is_a_vnode_of_an_edge_of(ST_Agraph_s g, ST_Agnode_s v)
static boolean
rank__c. is_cluster(ST_Agraph_s g)
static void
position__c. keepout_othernodes(ST_Agraph_s g)
static ST_Agnode_s
class2__c. label_vnode(ST_Agraph_s g, ST_Agedge_s orig)
static ST_Agnode_s
class2__c. leader_of(ST_Agraph_s g, ST_Agnode_s v)
static boolean
mincross__c. left2right(ST_Agraph_s g, ST_Agnode_s v, ST_Agnode_s w)
static void
class2__c. make_chain(ST_Agraph_s g, ST_Agnode_s from, ST_Agnode_s to, ST_Agedge_s orig)
static void
position__c. make_edge_pairs(ST_Agraph_s g)
static void
dotsplines__c. make_flat_adj_edges(ST_Agraph_s g, ST_path P, CArrayOfStar<ST_Agedge_s> edges, int ind, int cnt, ST_Agedge_s e0, int et)
static void
dotsplines__c. make_flat_edge(ST_Agraph_s g, ST_spline_info_t sp, ST_path P, CArrayOfStar<ST_Agedge_s> edges, int ind, int cnt, int et)
static void
dotsplines__c. make_flat_labeled_edge(ST_Agraph_s g, ST_spline_info_t sp, ST_path P, ST_Agedge_s e, int et)
static void
cluster__c. make_interclust_chain(ST_Agraph_s g, ST_Agnode_s from, ST_Agnode_s to, ST_Agedge_s orig)
static void
position__c. make_leafslots(ST_Agraph_s g)
static void
position__c. make_LR_constraints(ST_Agraph_s g)
static void
position__c. make_lrvn(ST_Agraph_s g)
static int
rank__c. make_new_cluster(ST_Agraph_s g, ST_Agraph_s subg)
static void
dotsplines__c. make_regular_edge(ST_Agraph_s g, ST_spline_info_t sp, ST_path P, CArrayOfStar<ST_Agedge_s> edges, int ind, int cnt, int et)
static void
cluster__c. make_slots(ST_Agraph_s root, int r, int pos, int d)
static ST_Agnode_s
flat__c. make_vn_slot(ST_Agraph_s g, int r, int pos)
static void
dotsplines__c. makeFlatEnd(ST_Agraph_s g, ST_spline_info_t sp, ST_path P, ST_Agnode_s n, ST_Agedge_s e, ST_pathend_t endp, boolean isBegin)
static int
dotsplines__c. makeLineEdge(ST_Agraph_s g, ST_Agedge_s fe, __ptr__ points, __ptr__ hp)
static void
cluster__c. mark_clusters(ST_Agraph_s g)
static void
cluster__c. mark_lowcluster_basic(ST_Agraph_s g)
static void
cluster__c. mark_lowclusters(ST_Agraph_s root)
static ST_boxf
dotsplines__c. maximal_bbox(ST_Agraph_s g, ST_spline_info_t sp, ST_Agnode_s vn, ST_Agedge_s ie, ST_Agedge_s oe)
static boolean
mincross__c. medians(ST_Agraph_s g, int r0, int r1)
static void
class2__c. merge_chain(ST_Agraph_s g, ST_Agedge_s e, ST_Agedge_s f, boolean flag)
static void
mincross__c. merge_components(ST_Agraph_s g)
static void
cluster__c. merge_ranks(ST_Agraph_s subg)
static void
mincross__c. merge2(ST_Agraph_s g)
static int
mincross__c. mincross_(ST_Agraph_s g, int startpass, int endpass, boolean doBalance)
static int
mincross__c. mincross_clust(ST_Agraph_s par, ST_Agraph_s g, boolean doBalance)
static void
mincross__c. mincross_options(ST_Agraph_s g)
static void
mincross__c. mincross_step(ST_Agraph_s g, int pass)
static ST_point
rank__c. minmax_edges(ST_Agraph_s g)
static boolean
rank__c. minmax_edges2(ST_Agraph_s g, ST_point slen)
static int
mincross__c. ncross(ST_Agraph_s g)
static ST_Agnode_s
dotsplines__c. neighbor(ST_Agraph_s g, ST_Agnode_s vn, ST_Agedge_s ie, ST_Agedge_s oe, int dir)
static void
rank__c. node_induce(ST_Agraph_s par, ST_Agraph_s g)
static int
position__c. nsiter2(ST_Agraph_s g)
static void
mincross__c. ordered_edges(ST_Agraph_s g)
static ST_Agnode_s
class2__c. plain_vnode(ST_Agraph_s g, ST_Agedge_s orig)
static void
position__c. pos_clusters(ST_Agraph_s g)
static int
mincross__c. postorder(ST_Agraph_s g, ST_Agnode_s v, CArrayOfStar<ST_Agnode_s> list, int r)
static ST_boxf
dotsplines__c. rank_box(ST_spline_info_t sp, ST_Agraph_s g, int r)
static int
rank__c. rank_set_class(ST_Agraph_s g)
static void
rank__c. rank1(ST_Agraph_s g)
static int
mincross__c. rcross(ST_Agraph_s g, int r)
static ST_Agraph_s
mincross__c. realFillRanks(ST_Agraph_s g, int[] rnks, int rnks_sz, ST_Agraph_s sg)
static void
position__c. rec_bb(ST_Agraph_s g, ST_Agraph_s root)
static void
mincross__c. rec_reset_vlists(ST_Agraph_s g)
static void
mincross__c. rec_save_vlists(ST_Agraph_s g)
static void
position__c. remove_aux_edges(ST_Agraph_s g)
static void
cluster__c. remove_rankleaders(ST_Agraph_s g)
static void
mincross__c. reorder(ST_Agraph_s g, int r, boolean reverse, boolean hasfixed)
static void
mincross__c. restore_best(ST_Agraph_s g)
static void
mincross__c. save_best(ST_Agraph_s g)
static void
mincross__c. save_vlist(ST_Agraph_s g)
static void
decomp__c. search_component(ST_Agraph_s g, ST_Agnode_s n)
static void
position__c. separate_subclust(ST_Agraph_s g)
static void
position__c. set_aspect(ST_Agraph_s g, ST_aspect_t asp)
static void
rank__c. set_minmax(ST_Agraph_s g)
static void
position__c. set_xcoords(ST_Agraph_s g)
static void
position__c. set_ycoords(ST_Agraph_s g)
static ST_aspect_t
aspect__c. setAspect(ST_Agraph_s g, ST_aspect_t adata)
static void
mincross__c. transpose(ST_Agraph_s g, boolean reverse)
static int
mincross__c. transpose_step(ST_Agraph_s g, int r, boolean reverse)
static ST_Agnode_s
fastgr__c. virtual_node(ST_Agraph_s g)
static boolean
position__c. vnode_not_related_to(ST_Agraph_s g, ST_Agnode_s v)
-
Uses of ST_Agraph_s in gen.lib.gvc
Methods in gen.lib.gvc with parameters of type ST_Agraph_s Modifier and Type Method Description static int
gvlayout__c. gvLayoutJobs(ST_GVC_s gvc, ST_Agraph_s g)
-
Uses of ST_Agraph_s in gen.lib.pack
Methods in gen.lib.pack with parameters of type ST_Agraph_s Modifier and Type Method Description static int
pack__c. getPack(ST_Agraph_s g, int not_def, int dflt)
static EN_pack_mode
pack__c. getPackInfo(ST_Agraph_s g, EN_pack_mode dflt, int dfltMargin, ST_pack_info pinfo)
static EN_pack_mode
pack__c. getPackModeInfo(ST_Agraph_s g, EN_pack_mode dflt, ST_pack_info pinfo)
-
Uses of ST_Agraph_s in h
Fields in h declared as ST_Agraph_s Modifier and Type Field Description ST_Agraph_s
ST_Agnodeinfo_t. clust
ST_Agraph_s
ST_Agraphinfo_t. dotroot
ST_Agraph_s
ST_Agraph_s. parent
ST_Agraph_s
ST_Agraphinfo_t. parent
ST_Agraph_s
ST_Agnode_s. root
ST_Agraph_s
ST_Agraph_s. root
Fields in h with type parameters of type ST_Agraph_s Modifier and Type Field Description CArrayOfStar<ST_Agraph_s>
ST_Agraphinfo_t. clust
-
Uses of ST_Agraph_s in net.sourceforge.plantuml.sdot
Methods in net.sourceforge.plantuml.sdot with parameters of type ST_Agraph_s Modifier and Type Method Description void
CucaDiagramFileMakerSmetana. drawGroup(UGraphic ug, YMirror ymirror, IGroup group, ST_Agraph_s gr)
-
Uses of ST_Agraph_s in smetana.core
Fields in smetana.core declared as ST_Agraph_s Modifier and Type Field Description ST_Agraph_s
Z. Ag_dictop_G
ST_Agraph_s
Z. G_decomp
ST_Agraph_s
Z. G_ns
ST_Agraph_s
Z. ProtoGraph
ST_Agraph_s
Z. Root
Methods in smetana.core that return ST_Agraph_s Modifier and Type Method Description static ST_Agraph_s
Macro. GD_dotroot(ST_Agraph_s g)
static ST_Agraph_s
Macro. ND_clust(ST_Agnode_s n)
Methods in smetana.core that return types with arguments of type ST_Agraph_s Modifier and Type Method Description static CArrayOfStar<ST_Agraph_s>
Macro. GD_clust(ST_Agraph_s g)
Method parameters in smetana.core with type arguments of type ST_Agraph_s Modifier and Type Method Description static void
Macro. GD_clust(ST_Agraph_s g, CArrayOfStar<ST_Agraph_s> v)
-