Gecko [ satitravel.com ]

Linux server1.hosting4iran.com 4.18.0-553.89.1.el8_10.x86_64 #1 SMP Mon Dec 8 03:53:08 EST 2025 x86_64
LiteSpeed
Server IP : 185.208.174.156 & Your IP : 216.73.216.218
Domains : 282 Domain
User : satitravel

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

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]);
  }
}