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

/* knbhd - Return the k-neighborhood of a node, i.e., allnodes
 * whose path length from the given node is <= k.
 * ARGV[] = k node_name
 */
BEG_G {
  node_t  ctr;
  int     maxlen;

graph_t comp = subg($, "kcomp");
  int     sid = 0, eid = 0;
  int     curlen;
  node_t  curnode;
  int     nlen[node_t];
  node_t  stk[int];
  node_t  other;
  edge_t  e;

if (ARGC != 2) {
    printf (2, "Two arguments required\n");
    exit(1);
  }

if (!sscanf(ARGV[0],"%d",&maxlen)) {
    printf (2, "Improper length parameter \"%s\"\n", ARGV[0]);
    exit(1);
  }
  maxlen++; /* length of 0 means unset */

ctr = isNode ($, ARGV[1]);
  if (!ctr) {
    printf (2, "node %s not found\n", ARGV[1]);
    exit(1);
  }

subnode (comp,ctr);
  nlen[ctr] = 1;
  curnode = ctr;
  while (curnode) {
    curlen = nlen[curnode];
    if (curlen == maxlen) break;
    
    for (e = fstedge(curnode); e; e = nxtedge(e,curnode)) {
      other = e.head;
      if (other == curnode) other = e.tail;
      if (nlen[other]) continue; /* already seen */
      subnode(comp,other);
      nlen[other] = curlen+1;
      stk[eid++] = other;
    }

if (sid < eid) curnode = stk[sid++];
    else curnode = NULL;
  }
  
  induce(comp);
  write(comp);
}