/usr/share/graphviz/gvpr
NameSizeModeActions
addedges2910644editdlrm
addranks8300644editdlrm
addrings13190644editdlrm
anon4220644editdlrm
attr1510644editdlrm
bb9970644editdlrm
bbox5320644editdlrm
binduce11660644editdlrm
bipart4550644editdlrm
chkclusters5320644editdlrm
chkedges9160644editdlrm
cliptree1780644editdlrm
col6010644editdlrm
collapse4690644editdlrm
color14400644editdlrm
cycle5600644editdlrm
dechain2640644editdlrm
deghist3510644editdlrm
deledges1160644editdlrm
delmulti3970644editdlrm
delnodes2490644editdlrm
depath5470644editdlrm
dijkstra6470644editdlrm
flatten880644editdlrm
get-layers-list2770644editdlrm
group7910644editdlrm
histogram3190644editdlrm
indent3780644editdlrm
knbhd12260644editdlrm
maxdeg3070644editdlrm
path4490644editdlrm
rotate11940644editdlrm
scale11470644editdlrm
scalexy11230644editdlrm
span1390644editdlrm
topon4290644editdlrm
treetoclust9880644editdlrm
Edit: /usr/share/graphviz/gvpr/treetoclust (988B)
/* Convert a rooted tree to a hierarchy of clusters for patchwork. * ARGV[0] is desired root */ BEG_G { node_t rt; node_t n; graph_t cg; graph_t sg; int depth; int mark[node_t]; graph_t stk[int]; if (! $.directed) { printf(2,"Input graph is not directed\n"); exit (1); } rt = isNode($,ARGV[0]); if (rt == NULL) { printf(2,"Root node \"%s\" not found\n", ARGV[0]); exit (1); } $tvroot = rt; $tvtype = TV_prepostfwd; cg = graph(rt.name,"U"); } N { if (mark[$]) { depth--; } else { mark[$] = 1; if (depth > 0) { if (fstout($)) { sg = subg(stk[depth-1], "cluster_" + $.name); if (($.style == "filled") && ($.fillcolor != "")) sg.bgcolor = $.fillcolor; } else { sg = NULL; n = node(stk[depth-1], $.name); n.style = "filled"; n.fillcolor = $.fillcolor; } } else sg = cg; stk[depth] = sg; depth++; } } END_G { write(cg); }