Uses of Interface
h.Agraph_s

Packages that use Agraph_s

Package	Description
gen.lib.cgraph
gen.lib.common
gen.lib.dotgen
gen.lib.gvc
gen.lib.pack
h
net.sourceforge.plantuml.jdot
smetana.core
smetana.core.amiga

Uses of Agraph_s in gen.lib.cgraph

Methods in gen.lib.cgraph that return Agraph_s

Modifier and Type	Method and Description
static Agraph_s	subg__c.agfindsubg_by_id(Agraph_s g, int id)
static Agraph_s	subg__c.agfstsubg(Agraph_s g)
static Agraph_s	subg__c.agnxtsubg(Agraph_s subg)
static Agraph_s	graph__c.agopen(CString name, __struct__<Agdesc_s> desc, Agdisc_s arg_disc)
static Agraph_s	graph__c.agopen1(Agraph_s g)
static Agraph_s	subg__c.agparent(Agraph_s g)
static Agraph_s	obj__c.agraphof(__ptr__ obj)
static Agraph_s	obj__c.agroot(__ptr__ obj)
static Agraph_s	subg__c.agsubg(Agraph_s g, CString name, boolean cflag)
static Agraph_s	subg__c.localsubg(Agraph_s g, int id)

Methods in gen.lib.cgraph with parameters of type Agraph_s

Modifier and Type	Method and Description
static void	attr__c.addattr(Agraph_s g, Agobj_s obj, Agsym_s sym)
static __ptr__	mem__c.agalloc(Agraph_s g, size_t size)
static int	apply__c.agapply(Agraph_s g, Agobj_s obj, CFunction fn, __ptr__ arg, boolean preorder)
static Agsym_s	attr__c.agattr(Agraph_s g, int kind, CString name, CString value)
static boolean	obj__c.agcontains(Agraph_s g, __ptr__ obj)
static Agdatadict_s	attr__c.agdatadict(Agraph_s g, boolean cflag)
static int	graph__c.agdegree(Agraph_s g, Agnode_s n, boolean want_in, boolean want_out)
static _dt_s	attr__c.agdictof(Agraph_s g, int kind)
static void	utils__c.agdtdisc(Agraph_s g, _dt_s dict, _dtdisc_s disc)
static _dt_s	utils__c.agdtopen(Agraph_s g, _dtdisc_s disc, _dtmethod_s method)
static Agedge_s	edge__c.agedge(Agraph_s g, Agnode_s t, Agnode_s h, CString name, boolean cflag)
static void	attr__c.agedgeattr_init(Agraph_s g, Agedge_s e)
static Agedge_s	edge__c.agfindedge_by_key(Agraph_s g, Agnode_s t, Agnode_s h, __struct__<Agtag_s> key)
static Agnode_s	node__c.agfindnode_by_id(Agraph_s g, int id)
static Agraph_s	subg__c.agfindsubg_by_id(Agraph_s g, int id)
static Agedge_s	edge__c.agfstedge(Agraph_s g, Agnode_s n)
static Agedge_s	edge__c.agfstin(Agraph_s g, Agnode_s n)
static Agnode_s	node__c.agfstnode(Agraph_s g)
static Agedge_s	edge__c.agfstout(Agraph_s g, Agnode_s n)
static Agraph_s	subg__c.agfstsubg(Agraph_s g)
static Agnode_s	node__c.agidnode(Agraph_s g, int id, int cflag)
static void	obj__c.aginitcb(Agraph_s g, __ptr__ obj, Agcbstack_s cbstack)
static int	imap__c.aginternalmaplookup(Agraph_s g, int objtype, CString str, int[] result)
static CString	imap__c.aginternalmapprint(Agraph_s g, int objtype, int id)
static boolean	graph__c.agisdirected(Agraph_s g)
static boolean	graph__c.agisstrict(Agraph_s g)
static boolean	graph__c.agisundirected(Agraph_s g)
static Agrec_s	attr__c.agmakeattrs(Agraph_s context, __ptr__ obj)
static Agdatadict_s	attr__c.agmakedatadict(Agraph_s g)
static int	id__c.agmapnametoid(Agraph_s g, int objtype, CString str, int[] result, boolean createflag)
static void	obj__c.agmethod_init(Agraph_s g, __ptr__ obj)
static void	obj__c.agmethod_upd(Agraph_s g, __ptr__ obj, Agsym_s sym)
static int	graph__c.agnedges(Agraph_s g)
static Agsym_s	attr__c.agnewsym(Agraph_s g, CString name, CString value, int id, int kind)
static int	graph__c.agnextseq(Agraph_s g, int objtype)
static int	graph__c.agnnodes(Agraph_s g)
static Agnode_s	node__c.agnode(Agraph_s g, CString name, boolean cflag)
static void	attr__c.agnodeattr_init(Agraph_s g, Agnode_s n)
static Agedge_s	edge__c.agnxtedge(Agraph_s g, Agedge_s e, Agnode_s n)
static Agedge_s	edge__c.agnxtin(Agraph_s g, Agedge_s e)
static Agnode_s	node__c.agnxtnode(Agraph_s g, Agnode_s n)
static Agedge_s	edge__c.agnxtout(Agraph_s g, Agedge_s e)
static Agraph_s	subg__c.agnxtsubg(Agraph_s subg)
static Agraph_s	graph__c.agopen1(Agraph_s g)
static Agraph_s	subg__c.agparent(Agraph_s g)
static void	attr__c.agraphattr_init(Agraph_s g)
static void	id__c.agregister(Agraph_s g, int objtype, Object obj)
static CString	refstr__c.agstrbind(Agraph_s g, CString s)
static CString	refstr__c.agstrdup(Agraph_s g, CString s)
static int	refstr__c.agstrfree(Agraph_s g, CString s)
static Agedge_s	edge__c.agsubedge(Agraph_s g, Agedge_s e, boolean cflag)
static Agraph_s	subg__c.agsubg(Agraph_s g, CString name, boolean cflag)
static Agnode_s	node__c.agsubnode(Agraph_s g, Agnode_s n0, boolean cflag)
static Agsubnode_s	edge__c.agsubrep(Agraph_s g, Agnode_s n)
static void	obj__c.agupdcb(Agraph_s g, __ptr__ obj, Agsym_s sym, Agcbstack_s cbstack)
static IMapEntry_t	imap__c.find_isym(Agraph_s g, int objtype, int id)
static Agsym_s	attr__c.getattr(Agraph_s g, int kind, CString name)
static Object	id__c.idopen(Agraph_s g, Agdisc_s disc)
static void	node__c.initnode(Agraph_s g, Agnode_s n)
static void	edge__c.installedge(Agraph_s g, Agedge_s e)
static void	node__c.installnode(Agraph_s g, Agnode_s n)
static void	node__c.installnodetoroot(Agraph_s g, Agnode_s n)
static Agraph_s	subg__c.localsubg(Agraph_s g, int id)
static Agedge_s	edge__c.newedge(Agraph_s g, Agnode_s t, Agnode_s h, int id)
static Agnode_s	node__c.newnode(Agraph_s g, int id, int seq)
static void	rec__c.objputrec(Agraph_s g, Agobj_s obj, Object arg)
static boolean	edge__c.ok_to_make_edge(Agraph_s g, Agnode_s t, Agnode_s h)
static void	apply__c.rec_apply(Agraph_s g, Agobj_s obj, CFunction fn, __ptr__ arg, CFunction objsearch, boolean preorder)
static _dt_s	refstr__c.refdict(Agraph_s g)
static Agsym_s	attr__c.setattr(Agraph_s g, int kind, CString name, CString value)
static Agobj_s	apply__c.subgraph_search(Agraph_s sub, Agobj_s g)

Uses of Agraph_s in gen.lib.common

Methods in gen.lib.common with parameters of type Agraph_s

Modifier and Type	Method and Description
static void	postproc__c.addXLabels(Agraph_s gp)
static void	input__c.do_graph_label(Agraph_s sg)
static void	postproc__c.dotneato_postprocess(Agraph_s g)
static int	input__c.findCharset(Agraph_s g)
static void	ns__c.freeTreeList(Agraph_s g)
static boolean	input__c.getdoubles2ptf(Agraph_s g, CString name, pointf result)
static void	input__c.graph_init(Agraph_s g, boolean use_rankdir)
static void	postproc__c.gv_postprocess(Agraph_s g, int allowTranslation)
static CString	utils__c.htmlEntityUTF8(CString s, Agraph_s g)
static int	ns__c.init_graph(Agraph_s g)
static __ptr__	emit__c.init_xdot(Agraph_s g)
static void	postproc__c.place_graph_label(Agraph_s g)
static int	ns__c.rank(Agraph_s g, int balance, int maxiter)
static int	ns__c.rank2(Agraph_s g, int balance, int maxiter, int search_size)
static void	utils__c.setEdgeType(Agraph_s g, int dflt)
static void	input__c.setRatio(Agraph_s g)
static void	postproc__c.translate_bb(Agraph_s g, int rankdir)
static void	postproc__c.translate_drawing(Agraph_s g)
static void	utils__c.updateBB(Agraph_s g, textlabel_t lp)

Uses of Agraph_s in gen.lib.dotgen

Methods in gen.lib.dotgen that return Agraph_s

Modifier and Type	Method and Description
static Agraph_s	dotsplines__c.cl_bound(Agraph_s g, Agnode_s n, Agnode_s adj)
static Agraph_s	dotinit__c.dot_root(__ptr__ p)
static Agraph_s	mincross__c.realFillRanks(Agraph_s g, __ptr__ rnks, int rnks_sz, Agraph_s sg)

Methods in gen.lib.dotgen with parameters of type Agraph_s

Modifier and Type	Method and Description
static void	flat__c.abomination(Agraph_s g)
static void	acyclic__c.acyclic_(Agraph_s g)
static void	position__c.allocate_aux_edges(Agraph_s g)
static void	mincross__c.allocate_ranks(Agraph_s g)
static void	mincross__c.build_ranks(Agraph_s g, int pass)
static void	cluster__c.build_skeleton(Agraph_s g, Agraph_s subg)
static Agraph_s	dotsplines__c.cl_bound(Agraph_s g, Agnode_s n, Agnode_s adj)
static boolean	dotsplines__c.cl_vninside(Agraph_s cl, Agnode_s n)
static void	class1__c.class1_(Agraph_s g)
static void	class2__c.class2(Agraph_s g)
static void	rank__c.cleanup1(Agraph_s g)
static void	mincross__c.cleanup2(Agraph_s g, int nc)
static Agnode_s	cluster__c.clone_vn(Agraph_s g, Agnode_s vn)
static int	position__c.clust_ht(Agraph_s g)
static void	rank__c.cluster_leader(Agraph_s clust)
static void	rank__c.collapse_cluster(Agraph_s g, Agraph_s subg)
static void	rank__c.collapse_sets(Agraph_s rg, Agraph_s g)
static void	position__c.compress_graph(Agraph_s g)
static void	position__c.connectGraph(Agraph_s g)
static boolean	mincross__c.constraining_flat_edge(Agraph_s g, Agnode_s v, Agedge_s e)
static void	position__c.contain_clustnodes(Agraph_s g)
static void	position__c.contain_nodes(Agraph_s g)
static void	position__c.contain_subclust(Agraph_s g)
static void	position__c.create_aux_edges(Agraph_s g)
static void	decomp__c.decompose(Agraph_s g, int pass)
static void	fastgr__c.delete_fast_node(Agraph_s g, Agnode_s n)
static void	dotinit__c.doDot(Agraph_s g)
static void	position__c.dot_compute_bb(Agraph_s g, Agraph_s root)
static void	dotinit__c.dot_init_node_edge(Agraph_s g)
static void	dotinit__c.dot_init_subg(Agraph_s g, Agraph_s droot)
static void	dotinit__c.dot_layout(Agraph_s g)
static void	mincross__c.dot_mincross(Agraph_s g, boolean doBalance)
static void	position__c.dot_position(Agraph_s g, aspect_t asp)
static void	rank__c.dot_rank(Agraph_s g, aspect_t asp)
static void	sameport__c.dot_sameports(Agraph_s g)
static void	dotsplines__c.dot_splines(Agraph_s g)
static void	rank__c.dot1_rank(Agraph_s g, aspect_t asp)
static void	dotinit__c.dotLayout(Agraph_s g)
static void	dotsplines__c.edge_normalize(Agraph_s g)
static void	rank__c.edgelabel_ranks(Agraph_s g)
static void	cluster__c.expand_cluster(Agraph_s subg)
static void	position__c.expand_leaves(Agraph_s g)
static void	rank__c.expand_ranksets(Agraph_s g, aspect_t asp)
static void	fastgr__c.fast_node(Agraph_s g, Agnode_s n)
static void	mincross__c.fillRanks(Agraph_s g)
static Agnode_s	fastgr__c.find_fast_node(Agraph_s g, Agnode_s n)
static void	mincross__c.flat_breakcycles(Agraph_s g)
static void	fastgr__c.flat_edge(Agraph_s g, Agedge_s e)
static int	flat__c.flat_edges(Agraph_s g)
static int	flat__c.flat_limits(Agraph_s g, Agedge_s e)
static void	mincross__c.flat_reorder(Agraph_s g)
static void	mincross__c.flat_rev(Agraph_s g, Agedge_s e)
static void	mincross__c.flat_search(Agraph_s g, Agnode_s v)
static Agnode_s	mincross__c.furthestnode(Agraph_s g, Agnode_s v, int dir)
static void	class2__c.incr_width(Agraph_s g, Agnode_s v)
static void	mincross__c.init_mccomp(Agraph_s g, int c)
static void	mincross__c.init_mincross(Agraph_s g)
static boolean	mincross__c.inside_cluster(Agraph_s g, Agnode_s v)
static void	cluster__c.install_cluster(Agraph_s g, Agnode_s n, int pass, nodequeue q)
static void	mincross__c.install_in_rank(Agraph_s g, Agnode_s n)
static void	cluster__c.interclexp(Agraph_s subg)
static void	class2__c.interclrep(Agraph_s g, Agedge_s e)
static void	class1__c.interclust1(Agraph_s g, Agnode_s t, Agnode_s h, Agedge_s e)
static boolean	mincross__c.is_a_normal_node_of(Agraph_s g, Agnode_s v)
static boolean	mincross__c.is_a_vnode_of_an_edge_of(Agraph_s g, Agnode_s v)
static boolean	rank__c.is_cluster(Agraph_s g)
static void	position__c.keepout_othernodes(Agraph_s g)
static Agnode_s	class2__c.label_vnode(Agraph_s g, Agedge_s orig)
static Agnode_s	class2__c.leader_of(Agraph_s g, Agnode_s v)
static boolean	mincross__c.left2right(Agraph_s g, Agnode_s v, Agnode_s w)
static void	class2__c.make_chain(Agraph_s g, Agnode_s from, Agnode_s to, Agedge_s orig)
static void	position__c.make_edge_pairs(Agraph_s g)
static void	dotsplines__c.make_flat_adj_edges(Agraph_s g, path P, __ptr__ edges, int ind, int cnt, Agedge_s e0, int et)
static void	dotsplines__c.make_flat_edge(Agraph_s g, spline_info_t sp, path P, __ptr__ edges, int ind, int cnt, int et)
static void	dotsplines__c.make_flat_labeled_edge(Agraph_s g, spline_info_t sp, path P, Agedge_s e, int et)
static void	cluster__c.make_interclust_chain(Agraph_s g, Agnode_s from, Agnode_s to, Agedge_s orig)
static void	position__c.make_leafslots(Agraph_s g)
static void	position__c.make_LR_constraints(Agraph_s g)
static void	position__c.make_lrvn(Agraph_s g)
static int	rank__c.make_new_cluster(Agraph_s g, Agraph_s subg)
static void	dotsplines__c.make_regular_edge(Agraph_s g, spline_info_t sp, path P, __ptr__ edges, int ind, int cnt, int et)
static void	cluster__c.make_slots(Agraph_s root, int r, int pos, int d)
static Agnode_s	flat__c.make_vn_slot(Agraph_s g, int r, int pos)
static void	dotsplines__c.makeFlatEnd(Agraph_s g, spline_info_t sp, path P, Agnode_s n, Agedge_s e, pathend_t endp, boolean isBegin)
static int	dotsplines__c.makeLineEdge(Agraph_s g, Agedge_s fe, __ptr__ points, __ptr__ hp)
static void	cluster__c.mark_clusters(Agraph_s g)
static void	cluster__c.mark_lowcluster_basic(Agraph_s g)
static void	cluster__c.mark_lowclusters(Agraph_s root)
static __struct__<boxf>	dotsplines__c.maximal_bbox(Agraph_s g, spline_info_t sp, Agnode_s vn, Agedge_s ie, Agedge_s oe)
static boolean	mincross__c.medians(Agraph_s g, int r0, int r1)
static void	class2__c.merge_chain(Agraph_s g, Agedge_s e, Agedge_s f, boolean flag)
static void	mincross__c.merge_components(Agraph_s g)
static void	cluster__c.merge_ranks(Agraph_s subg)
static void	mincross__c.merge2(Agraph_s g)
static int	mincross__c.mincross_(Agraph_s g, int startpass, int endpass, boolean doBalance)
static int	mincross__c.mincross_clust(Agraph_s par, Agraph_s g, boolean doBalance)
static void	mincross__c.mincross_options(Agraph_s g)
static void	mincross__c.mincross_step(Agraph_s g, int pass)
static __struct__<point>	rank__c.minmax_edges(Agraph_s g)
static boolean	rank__c.minmax_edges2(Agraph_s g, __struct__<point> slen)
static int	mincross__c.ncross(Agraph_s g)
static Agnode_s	dotsplines__c.neighbor(Agraph_s g, Agnode_s vn, Agedge_s ie, Agedge_s oe, int dir)
static void	rank__c.node_induce(Agraph_s par, Agraph_s g)
static int	position__c.nsiter2(Agraph_s g)
static void	mincross__c.ordered_edges(Agraph_s g)
static Agnode_s	class2__c.plain_vnode(Agraph_s g, Agedge_s orig)
static void	position__c.pos_clusters(Agraph_s g)
static int	mincross__c.postorder(Agraph_s g, Agnode_s v, __ptr__ list, int r)
static __struct__<boxf>	dotsplines__c.rank_box(spline_info_t sp, Agraph_s g, int r)
static int	rank__c.rank_set_class(Agraph_s g)
static void	rank__c.rank1(Agraph_s g)
static int	mincross__c.rcross(Agraph_s g, int r)
static Agraph_s	mincross__c.realFillRanks(Agraph_s g, __ptr__ rnks, int rnks_sz, Agraph_s sg)
static void	position__c.rec_bb(Agraph_s g, Agraph_s root)
static void	mincross__c.rec_reset_vlists(Agraph_s g)
static void	mincross__c.rec_save_vlists(Agraph_s g)
static void	position__c.remove_aux_edges(Agraph_s g)
static void	cluster__c.remove_rankleaders(Agraph_s g)
static void	mincross__c.reorder(Agraph_s g, int r, boolean reverse, boolean hasfixed)
static void	mincross__c.restore_best(Agraph_s g)
static void	mincross__c.save_best(Agraph_s g)
static void	mincross__c.save_vlist(Agraph_s g)
static void	decomp__c.search_component(Agraph_s g, Agnode_s n)
static void	position__c.separate_subclust(Agraph_s g)
static void	position__c.set_aspect(Agraph_s g, aspect_t asp)
static void	rank__c.set_minmax(Agraph_s g)
static void	position__c.set_xcoords(Agraph_s g)
static void	position__c.set_ycoords(Agraph_s g)
static aspect_t	aspect__c.setAspect(Agraph_s g, aspect_t adata)
static int	mincross__c.transpose_step(Agraph_s g, int r, boolean reverse)
static void	mincross__c.transpose(Agraph_s g, boolean reverse)
static Agnode_s	fastgr__c.virtual_node(Agraph_s g)
static boolean	position__c.vnode_not_related_to(Agraph_s g, Agnode_s v)

Uses of Agraph_s in gen.lib.gvc

Methods in gen.lib.gvc with parameters of type Agraph_s

Modifier and Type	Method and Description
static int	gvlayout__c.gvLayoutJobs(GVC_s gvc, Agraph_s g)

Uses of Agraph_s in gen.lib.pack

Methods in gen.lib.pack with parameters of type Agraph_s

Modifier and Type	Method and Description
static int	pack__c.getPack(Agraph_s g, int not_def, int dflt)
static int	pack__c.getPackInfo(Agraph_s g, int dflt, int dfltMargin, pack_info pinfo)
static int	pack__c.getPackModeInfo(Agraph_s g, int dflt, pack_info pinfo)

Uses of Agraph_s in h

Subinterfaces of Agraph_s in h

Modifier and Type	Interface and Description
interface	Agraph_t
interface	graph_t

Uses of Agraph_s in net.sourceforge.plantuml.jdot

Methods in net.sourceforge.plantuml.jdot with parameters of type Agraph_s

Modifier and Type	Method and Description
void	CucaDiagramFileMakerJDot.drawGroup(UGraphic ug, YMirror ymirror, IGroup group, Agraph_s gr)

Uses of Agraph_s in smetana.core

Subinterfaces of Agraph_s in smetana.core

Modifier and Type	Interface and Description
interface	AllH

Fields in smetana.core declared as Agraph_s

Modifier and Type	Field and Description
Agraph_s	Z.Ag_dictop_G
Agraph_s	Z.G_decomp
Agraph_s	Z.G_ns
Agraph_s	Z.ProtoGraph
Agraph_s	Z.Root

Methods in smetana.core that return Agraph_s

Modifier and Type	Method and Description
static Agraph_s	Macro.GD_dotroot(Agraph_s g)
static Agraph_s	Macro.ND_clust(__ptr__ n)

Methods in smetana.core with parameters of type Agraph_s

Modifier and Type	Method and Description
static __array_of_struct__	Macro.GD_border(Agraph_s g)
static int	Macro.GD_charset(Agraph_s g)
static void	Macro.GD_charset(Agraph_s g, int v)
static __ptr__	Macro.GD_cleanup(Agraph_s g)
static void	Macro.GD_clust(Agraph_s g, __ptr__ v)
static __ptr__	Macro.GD_clust(Agraph_s g)
static __struct__<nlist_t>	Macro.GD_comp(Agraph_s g)
static void	Macro.GD_dotroot(Agraph_s g, __ptr__ v)
static Agraph_s	Macro.GD_dotroot(Agraph_s g)
static void	Macro.GD_drawing(Agraph_s g, __ptr__ v)
static __ptr__	Macro.GD_drawing(Agraph_s g)
static int	Macro.GD_exact_ranksep(Agraph_s g)
static void	Macro.GD_exact_ranksep(Agraph_s g, int v)
static boolean	Macro.GD_expanded(Agraph_s g)
static void	Macro.GD_expanded(Agraph_s g, boolean v)
static int	Macro.GD_flags(Agraph_s g)
static void	Macro.GD_flags(Agraph_s g, int v)
static int	Macro.GD_flip(Agraph_s g)
static int	Macro.GD_fontnames(Agraph_s g)
static void	Macro.GD_fontnames(Agraph_s g, int v)
static GVC_s	Macro.GD_gvc(Agraph_s g)
static void	Macro.GD_gvc(Agraph_s g, GVC_s v)
static int	Macro.GD_has_flat_edges(Agraph_s g)
static void	Macro.GD_has_flat_edges(Agraph_s g, boolean v)
static double	Macro.GD_ht1(Agraph_s g)
static void	Macro.GD_ht1(Agraph_s g, double v)
static double	Macro.GD_ht2(Agraph_s g)
static void	Macro.GD_ht2(Agraph_s g, double v)
static int	Macro.GD_installed(Agraph_s g)
static void	Macro.GD_installed(Agraph_s g, int v)
static int	Macro.GD_label_pos(Agraph_s g)
static void	Macro.GD_label_pos(Agraph_s g, int v)
static void	Macro.GD_leader(Agraph_s g, __ptr__ v)
static Agnode_s	Macro.GD_leader(Agraph_s g)
static void	Macro.GD_ln(Agraph_s g, __ptr__ v)
static Agnode_s	Macro.GD_ln(Agraph_s g)
static int	Macro.GD_maxrank(Agraph_s g)
static void	Macro.GD_maxrank(Agraph_s g, int v)
static __ptr__	Macro.GD_maxset(Agraph_s g)
static int	Macro.GD_minrank(Agraph_s g)
static void	Macro.GD_minrank(Agraph_s g, int v)
static __ptr__	Macro.GD_minset(Agraph_s g)
static int	Macro.GD_n_cluster(Agraph_s g)
static void	Macro.GD_n_cluster(Agraph_s g, int v)
static int	Macro.GD_n_nodes(Agraph_s g)
static void	Macro.GD_n_nodes(Agraph_s g, int v)
static void	Macro.GD_nlist(Agraph_s g, __ptr__ v)
static Agnode_s	Macro.GD_nlist(Agraph_s g)
static int	Macro.GD_nodesep(Agraph_s g)
static void	Macro.GD_nodesep(Agraph_s g, int v)
static void	Macro.GD_parent(Agraph_s g, __ptr__ v)
static __ptr__	Macro.GD_parent(Agraph_s g)
static void	Macro.GD_rank(Agraph_s g, __ptr__ v)
static __ptr__	Macro.GD_rank(Agraph_s g)
static int	Macro.GD_rankdir(Agraph_s g)
static int	Macro.GD_rankdir2(Agraph_s g)
static void	Macro.GD_rankdir2(Agraph_s g, int v)
static void	Macro.GD_rankleader(Agraph_s g, __ptr__ v)
static __ptr__	Macro.GD_rankleader(Agraph_s g)
static int	Macro.GD_ranksep(Agraph_s g)
static void	Macro.GD_ranksep(Agraph_s g, int v)
static void	Macro.GD_rn(Agraph_s g, __ptr__ v)
static Agnode_s	Macro.GD_rn(Agraph_s g)
static int	Macro.GD_set_type(Agraph_s g)
static void	Macro.GD_set_type(Agraph_s g, int v)
static int	Macro.GD_showboxes(Agraph_s g)
static void	Macro.GD_showboxes(Agraph_s g, int v)

Uses of Agraph_s in smetana.core.amiga

Classes in smetana.core.amiga that implement Agraph_s

Modifier and Type	Class and Description
class	StarArrayOfCString
class	StarArrayOfInteger
class	StarArrayOfPtr
class	StarArrayOfStruct
class	StarStruct