FM / gvpr

/usr/share/graphviz/gvpr

Name	Size	Mode	Actions
addedges	291	0644	edit dl rm
addranks	830	0644	edit dl rm
addrings	1319	0644	edit dl rm
anon	422	0644	edit dl rm
attr	151	0644	edit dl rm
bb	997	0644	edit dl rm
bbox	532	0644	edit dl rm
binduce	1166	0644	edit dl rm
bipart	455	0644	edit dl rm
chkclusters	532	0644	edit dl rm
chkedges	916	0644	edit dl rm
cliptree	178	0644	edit dl rm
col	601	0644	edit dl rm
collapse	469	0644	edit dl rm
color	1440	0644	edit dl rm
cycle	560	0644	edit dl rm
dechain	264	0644	edit dl rm
deghist	351	0644	edit dl rm
deledges	116	0644	edit dl rm
delmulti	397	0644	edit dl rm
delnodes	249	0644	edit dl rm
depath	547	0644	edit dl rm
dijkstra	647	0644	edit dl rm
flatten	88	0644	edit dl rm
get-layers-list	277	0644	edit dl rm
group	791	0644	edit dl rm
histogram	319	0644	edit dl rm
indent	378	0644	edit dl rm
knbhd	1226	0644	edit dl rm
maxdeg	307	0644	edit dl rm
path	449	0644	edit dl rm
rotate	1194	0644	edit dl rm
scale	1147	0644	edit dl rm
scalexy	1123	0644	edit dl rm
span	139	0644	edit dl rm
topon	429	0644	edit dl rm
treetoclust	988	0644	edit dl rm

Edit: /usr/share/graphviz/gvpr/scale (1147B)

/* 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);
    }
}

/* 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