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

/* Given a bipartite graph, induce a non-bipartite graph.
 * argv[0]="name=value" This is used to identify the nodes used
 * to induce edges. If aget(n,name) == value, 
 *  if deg(n) == 1, delete
 *  if deg(n) == 2, delete and connect to neighbor with edge
 *  if deg(n) > 2, delete and add edge between all pairs of neighbors
 *  Add weights to edge.
 */
BEGIN{
  int i, cnt;
  int wt[edge_t];
  string values[int];
  node_t nbrs[int];
  edge_t e;
  tokens(ARGV[0],values,"=");
  string aname = values[0];
  string value = values[1];
  printf(2, "%s=%s\n", aname, value);
}
N[aget($,aname)==value] {
  if ($.degree > 1) {
    cnt = 0;
    for (e = fstedge($); e; e = nxtedge(e, $))
      nbrs[cnt++] = opp(e,$);
    for (i = 0; i < cnt-1; i++) {
      if ((e = isEdge(nbrs[i],nbrs[i+1],"")) != NULL) {
        wt[e] += 1;
      }
      else if ($G.directed && (e = isEdge(nbrs[i+1],nbrs[i],""))) {
        wt[e] += 1;
      }
      else if (nbrs[i] != nbrs[i+1]) { // avoid loops
        e = edge(nbrs[i],nbrs[i+1],"");
        wt[e] = 1;
      }
    }
    unset(nbrs);
  }
  delete($G,$);
}
END_G{
  for (wt[e]) {
    e.multiplicity = sprintf ("%d", wt[e]);
  }
}