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 : chkedges
/* Looks for multiedges and loops, and output * those found along with counts. If the -d flag * is given, edge direction is taken into account. */ BEGIN{ char* ename; char* n; int doDir, cnt[]; int loopcnt[]; int nloops, nmulti; if ((ARGC > 0) && (ARGV[0] == "-d")) doDir = 1; else doDir = 0; } BEG_G{unset(cnt); unset(loopcnt); nloops = nmulti = 0;} E{ if (doDir || (tail.name <= head.name)) ename=tail.name+"_"+head.name; else ename = head.name+"_"+tail.name; if (tail == head) { loopcnt[ename] += 1; if (loopcnt[ename] == 1) nloops += 1; } else { cnt[ename] += 1; if (cnt[ename] == 2) nmulti += 1; } } END_G{ printf ("graph %s: %d loops %d multiedges\n", $.name, nloops, nmulti); for (cnt[n]) { if (cnt[n] > 1) printf ("%s : %d\n", n, cnt[n]); } for (loopcnt[n]) { if (loopcnt[n] > 0) printf ("%s : %d\n", n, loopcnt[n]); } }
Close