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
Terminal
Auto Root
Create File
Create Folder
Localroot Suggester
Backdoor Destroyer
Readme
/
usr /
share /
graphviz /
gvpr /
Delete
Unzip
Name
Size
Permission
Date
Action
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
Save
Rename
/* Given graph processed by dijkstra, and node, * color shortest path * Assumes path has been computed by dijkstra */ BEG_G { node_t n = isNode($,ARGV[0]); node_t nxt; edge_t e; double d, totd = 0; if (n == NULL) { printf(2, "no node named \"%s\"\n", ARGV[0]); exit(1); } while (n.prev != "") { nxt = isNode($,n.prev); /* printf(2, "nxt \"%s\"\n", nxt.name); */ e = isEdge (n, nxt, ""); if (e == NULL) { printf(2, "no edge between %s and %s\n", n.name, nxt.name); } e.color = "blue"; /* printf(2, "len %s\n", e.len); */ /* sscanf (e.len, "%f", &d); */ /* totd += d; */ n = nxt; } }