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

/* Takes a graph laid out by twopi and adds rings.
 * Assumes ARGV[] = "root" "=" <rootname>, as output by twopi -v.
 * Usage:
 *   twopi -v foo.dot > out 2> log
 *   gvpr -f addrings.g -a"`grep root log`" out | neato -n2 ...
 */
BEG_G {
  graph_t og;
  edge_t e;
  node_t ctr = node($, ARGV[0]);
  double rs = 1.0; /* min. slack between the squares of two consecutive radii */
  int cx, cy;
  int x, y;
  node_t n;
  int i, n_r;
  int d;
  int rads[int];
  char* ctr_s = ctr.pos;
  sscanf (ctr_s, "%d,%d", &cx, &cy);
  if (hasAttr($, "ranksep")) {
    sscanf ($.ranksep, "%f", &rs);
    if (rs == 0.0) rs = 1.0;
  }
  rs *= 72;
  rs = 1.5*rs*rs;
}
N [$ != ctr] {
  sscanf ($.pos, "%d,%d", &x, &y);
  d = (x-cx)*(x-cx) + (y-cy)*(y-cy);
  for (rads[i]) {
    if ((rads[i]-rs <= d) && (d <= rads[i]+rs)) return;
  }
  n_r++;
  rads[n_r] = d;
}
END_G {
  og = copy (NULL, $);
  og.outputorder = "nodesfirst";
  setDflt (og, "N", "label", "\\N");
  for (rads[i]) {
    n = node(og, "ring_"+((string)i));
    n.shape = "circle";
    n.pos = ctr_s;
    n.style = "";
    n.label = "";
    d = rads[i];
    n.width = sprintf("%f", sqrt(d)/36.0);
  }
  for (n=fstnode($);n;n = nxtnode(n))
    clone (og, n);
  for (n=fstnode($);n;n = nxtnode(n))
    for (e=fstedge(n);e;e = nxtedge(e,n))
      clone (og, e);
  write(og);
  
}