Linux iad1-shared-b7-18 6.6.49-grsec-jammy+ #10 SMP Thu Sep 12 23:23:08 UTC 2024 x86_64
Apache
: 67.205.6.31 | : 216.73.216.47
Cant Read [ /etc/named.conf ]
8.2.29
fernandoquevedo
Terminal
AUTO ROOT
Adminer
Backdoor Destroyer
Linux Exploit
Lock Shell
Lock File
Create User
CREATE RDP
PHP Mailer
BACKCONNECT
UNLOCK SHELL
HASH IDENTIFIER
README
+ Create Folder
+ Create File
/
usr /
lib /
python3 /
dist-packages /
django /
utils /
[ HOME SHELL ]
Name
Size
Permission
Action
__pycache__
[ DIR ]
drwxr-xr-x
translation
[ DIR ]
drwxr-xr-x
__init__.py
0
B
-rw-r--r--
_os.py
2.24
KB
-rw-r--r--
archive.py
7.88
KB
-rw-r--r--
asyncio.py
1.29
KB
-rw-r--r--
autoreload.py
23.67
KB
-rw-r--r--
baseconv.py
2.92
KB
-rw-r--r--
cache.py
15.88
KB
-rw-r--r--
connection.py
2.19
KB
-rw-r--r--
crypto.py
3.07
KB
-rw-r--r--
datastructures.py
9.66
KB
-rw-r--r--
dateformat.py
9.97
KB
-rw-r--r--
dateparse.py
4.78
KB
-rw-r--r--
dates.py
1.97
KB
-rw-r--r--
datetime_safe.py
2.79
KB
-rw-r--r--
deconstruct.py
1.93
KB
-rw-r--r--
decorators.py
6.67
KB
-rw-r--r--
deprecation.py
5.08
KB
-rw-r--r--
duration.py
1.21
KB
-rw-r--r--
encoding.py
9.2
KB
-rw-r--r--
feedgenerator.py
14.75
KB
-rw-r--r--
formats.py
8.82
KB
-rw-r--r--
functional.py
13.81
KB
-rw-r--r--
hashable.py
706
B
-rw-r--r--
html.py
15.19
KB
-rw-r--r--
http.py
17.29
KB
-rw-r--r--
inspect.py
2.23
KB
-rw-r--r--
ipv6.py
1.65
KB
-rw-r--r--
itercompat.py
184
B
-rw-r--r--
jslex.py
7.51
KB
-rw-r--r--
log.py
7.7
KB
-rw-r--r--
lorem_ipsum.py
4.66
KB
-rw-r--r--
module_loading.py
3.51
KB
-rw-r--r--
numberformat.py
3.53
KB
-rw-r--r--
regex_helper.py
12.44
KB
-rw-r--r--
safestring.py
1.72
KB
-rw-r--r--
termcolors.py
7.19
KB
-rw-r--r--
text.py
15.49
KB
-rw-r--r--
timesince.py
3.41
KB
-rw-r--r--
timezone.py
7.98
KB
-rw-r--r--
topological_sort.py
1.18
KB
-rw-r--r--
tree.py
4.8
KB
-rw-r--r--
version.py
3.34
KB
-rw-r--r--
xmlutils.py
1.12
KB
-rw-r--r--
Delete
Unzip
Zip
${this.title}
Close
Code Editor : topological_sort.py
class CyclicDependencyError(ValueError): pass def topological_sort_as_sets(dependency_graph): """ Variation of Kahn's algorithm (1962) that returns sets. Take a dependency graph as a dictionary of node => dependencies. Yield sets of items in topological order, where the first set contains all nodes without dependencies, and each following set contains all nodes that may depend on the nodes only in the previously yielded sets. """ todo = dependency_graph.copy() while todo: current = {node for node, deps in todo.items() if not deps} if not current: raise CyclicDependencyError('Cyclic dependency in graph: {}'.format( ', '.join(repr(x) for x in todo.items()))) yield current # remove current from todo's nodes & dependencies todo = {node: (dependencies - current) for node, dependencies in todo.items() if node not in current} def stable_topological_sort(nodes, dependency_graph): result = [] for layer in topological_sort_as_sets(dependency_graph): for node in nodes: if node in layer: result.append(node) return result
Close
