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: scale
/* finds node n with root attribute * finds distance minr of closest node * the layout is then scaled out from n so that * a node is put on the smallest circle of radius x*minr * containing n */ BEG_G { node_t ctr; int cx, cy; int x, y; double delx, dely; int newx, newy; node_t n; edge_t e; int i, sc, d, mind = -1; double fact, newr, ang, minr; ctr = node($,aget($,"root")); sscanf (ctr.pos, "%d,%d", &cx, &cy); for (e = fstedge(ctr); e; e = nxtedge(e, ctr)) { if (e.head == ctr) n = e.tail; else n = e.head; sscanf (n.pos, "%d,%d", &x, &y); d = (x-cx)*(x-cx) + (y-cy)*(y-cy); if ((mind == -1) || (d < mind)) mind = d; } minr = (int)sqrt((double)mind); } N [$ != ctr] { sscanf ($.pos, "%d,%d", &x, &y); dely = y - cy; delx = x - cx; d = delx*delx + dely*dely; sc = (int)sqrt((double)(d/mind)); if (sc > 1) { fact = 2.0; for (i=1; i<sc-1;i++) fact *= 2.0; newr = minr*(2.0 - (1.0/fact)); ang = atan2 (dely, delx); newx = newr*cos(ang) + cx; newy = newr*sin(ang) + cy; $.pos = sprintf ("%d,%d", newx, newy); } }
Upload File
Create Folder