Geforce File Manager

NAME	SIZE	ACTIONS
📄 addedges	291 B	[ EDIT ] \| [ DEL ]
📄 addranks	830 B	[ EDIT ] \| [ DEL ]
📄 addrings	1,319 B	[ EDIT ] \| [ DEL ]
📄 anon	422 B	[ EDIT ] \| [ DEL ]
📄 attr	151 B	[ EDIT ] \| [ DEL ]
📄 bb	997 B	[ EDIT ] \| [ DEL ]
📄 bbox	532 B	[ EDIT ] \| [ DEL ]
📄 binduce	1,166 B	[ EDIT ] \| [ DEL ]
📄 bipart	455 B	[ EDIT ] \| [ DEL ]
📄 chkclusters	532 B	[ EDIT ] \| [ DEL ]
📄 chkedges	916 B	[ EDIT ] \| [ DEL ]
📄 cliptree	178 B	[ EDIT ] \| [ DEL ]
📄 col	601 B	[ EDIT ] \| [ DEL ]
📄 collapse	469 B	[ EDIT ] \| [ DEL ]
📄 color	1,440 B	[ EDIT ] \| [ DEL ]
📄 cycle	560 B	[ EDIT ] \| [ DEL ]
📄 dechain	264 B	[ EDIT ] \| [ DEL ]
📄 deghist	351 B	[ EDIT ] \| [ DEL ]
📄 deledges	116 B	[ EDIT ] \| [ DEL ]
📄 delmulti	397 B	[ EDIT ] \| [ DEL ]
📄 delnodes	249 B	[ EDIT ] \| [ DEL ]
📄 depath	547 B	[ EDIT ] \| [ DEL ]
📄 dijkstra	647 B	[ EDIT ] \| [ DEL ]
📄 flatten	88 B	[ EDIT ] \| [ DEL ]
📄 get-layers-list	277 B	[ EDIT ] \| [ DEL ]
📄 group	791 B	[ EDIT ] \| [ DEL ]
📄 histogram	319 B	[ EDIT ] \| [ DEL ]
📄 indent	378 B	[ EDIT ] \| [ DEL ]
📄 knbhd	1,226 B	[ EDIT ] \| [ DEL ]
📄 maxdeg	307 B	[ EDIT ] \| [ DEL ]
📄 path	449 B	[ EDIT ] \| [ DEL ]
📄 rotate	1,194 B	[ EDIT ] \| [ DEL ]
📄 scale	1,147 B	[ EDIT ] \| [ DEL ]
📄 scalexy	1,123 B	[ EDIT ] \| [ DEL ]
📄 span	139 B	[ EDIT ] \| [ DEL ]
📄 topon	429 B	[ EDIT ] \| [ DEL ]
📄 treetoclust	988 B	[ EDIT ] \| [ DEL ]

[ CLOSE ]

EDIT: 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);
    }
}