X7ROOT File Manager
Current Path:
/usr/share/graphviz/gvpr
usr
/
share
/
graphviz
/
gvpr
/
📁
..
📄
addedges
(291 B)
📄
addranks
(830 B)
📄
addrings
(1.29 KB)
📄
anon
(422 B)
📄
attr
(151 B)
📄
bb
(997 B)
📄
bbox
(532 B)
📄
binduce
(1.14 KB)
📄
bipart
(455 B)
📄
chkclusters
(532 B)
📄
chkedges
(916 B)
📄
cliptree
(178 B)
📄
col
(601 B)
📄
collapse
(469 B)
📄
color
(1.41 KB)
📄
cycle
(560 B)
📄
dechain
(264 B)
📄
deghist
(351 B)
📄
deledges
(116 B)
📄
delmulti
(397 B)
📄
delnodes
(249 B)
📄
depath
(547 B)
📄
dijkstra
(647 B)
📄
flatten
(88 B)
📄
get-layers-list
(277 B)
📄
group
(791 B)
📄
histogram
(319 B)
📄
indent
(378 B)
📄
knbhd
(1.2 KB)
📄
maxdeg
(307 B)
📄
path
(449 B)
📄
rotate
(1.17 KB)
📄
scale
(1.12 KB)
📄
scalexy
(1.1 KB)
📄
span
(139 B)
📄
topon
(429 B)
📄
treetoclust
(988 B)
Editing: bb
/* computes the bounding box of a graph based on its nodes taking into account clusters and node sizes. */ BEGIN { double x, y, w2, h2; double llx, lly, urx, ury; double llx0, lly0, urx0, ury0; graph_t clustBB (graph_t G) { graph_t sg; for (sg = fstsubg(G); sg; sg = nxtsubg(sg)) { sg = clustBB(sg); } if (G.name == "cluster*") { sscanf (G.bb, "%lf,%lf,%lf,%lf", &llx0, &lly0, &urx0, &ury0); if (llx0 < llx) llx = llx0; if (lly0 < lly) lly = lly0; if (urx0 > urx) urx = urx0; if (ury0 > ury) ury = ury0; } return G; } } BEG_G { llx = 1000000; lly = 1000000; urx = -1000000; ury = -1000000; } N { sscanf ($.pos, "%lf,%lf", &x, &y); w2 = (36.0*(double)$.width); h2 = (36.0*(double)$.height); if ((x - w2) < llx) llx = x - w2; if ((x + w2) > urx) urx = x + w2; if ((y - h2) < lly) lly = y - h2; if ((y + h2) > ury) ury = y + h2; } END_G { clustBB ($); $.bb = sprintf ("%lf,%lf,%lf,%lf", llx, lly, urx, ury); }
Upload File
Create Folder