Gecko [ tanishkshah.com ]

Linux evo.fastest-server.com 5.14.0-284.1101.el9.tuxcare.11.els11.x86_64 #1 SMP PREEMPT_DYNAMIC Fri Aug 14 13:30:35 UTC 2026 x86_64
LiteSpeed
Server IP : 103.249.112.113 & Your IP : 216.73.217.135
Domains : 988 Domain
User : tanishks

Name	Size	Permission	Date
addedges	291 B	-rw-r--r--	2024-04-03 11:16
addranks	830 B	-rw-r--r--	2024-04-03 11:16
addrings	1.29 KB	-rw-r--r--	2024-04-03 11:16
anon	422 B	-rw-r--r--	2024-04-03 11:16
attr	151 B	-rw-r--r--	2024-04-03 11:16
bb	997 B	-rw-r--r--	2024-04-03 11:16
bbox	532 B	-rw-r--r--	2024-04-03 11:16
binduce	1.14 KB	-rw-r--r--	2024-04-03 11:16
bipart	455 B	-rw-r--r--	2024-04-03 11:16
chkclusters	532 B	-rw-r--r--	2024-04-03 11:16
chkedges	916 B	-rw-r--r--	2024-04-03 11:16
cliptree	178 B	-rw-r--r--	2024-04-03 11:16
col	601 B	-rw-r--r--	2024-04-03 11:16
collapse	469 B	-rw-r--r--	2024-04-03 11:16
color	1.41 KB	-rw-r--r--	2024-04-03 11:16
cycle	560 B	-rw-r--r--	2024-04-03 11:16
dechain	264 B	-rw-r--r--	2024-04-03 11:16
deghist	351 B	-rw-r--r--	2024-04-03 11:16
deledges	116 B	-rw-r--r--	2024-04-03 11:16
delmulti	397 B	-rw-r--r--	2024-04-03 11:16
delnodes	249 B	-rw-r--r--	2024-04-03 11:16
depath	547 B	-rw-r--r--	2024-04-03 11:16
dijkstra	647 B	-rw-r--r--	2024-04-03 11:16
flatten	88 B	-rw-r--r--	2024-04-03 11:16
get-layers-list	277 B	-rw-r--r--	2024-04-03 11:16
group	791 B	-rw-r--r--	2024-04-03 11:16
histogram	319 B	-rw-r--r--	2024-04-03 11:16
indent	378 B	-rw-r--r--	2024-04-03 11:16
knbhd	1.2 KB	-rw-r--r--	2024-04-03 11:16
maxdeg	307 B	-rw-r--r--	2024-04-03 11:16
path	449 B	-rw-r--r--	2024-04-03 11:16
rotate	1.17 KB	-rw-r--r--	2024-04-03 11:16
scale	1.12 KB	-rw-r--r--	2024-04-03 11:16
scalexy	1.1 KB	-rw-r--r--	2024-04-03 11:16
span	139 B	-rw-r--r--	2024-04-03 11:16
topon	429 B	-rw-r--r--	2024-04-03 11:16
treetoclust	988 B	-rw-r--r--	2024-04-03 11:16

Rename

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