Compute the strongly connected components of a graph.
Project description
Compute the strongly connected components of a graph.
type Graph[L] = Mapping[L, Collection[L]]
def strongly_connected_components[L](graph: Graph[L]) -> Iterator[frozenset[L]]
Release history Release notifications | RSS feed
Download files
Download the file for your platform. If you're not sure which to choose, learn more about installing packages.
Source Distribution
Built Distribution
Filter files by name, interpreter, ABI, and platform.
If you're not sure about the file name format, learn more about wheel file names.
Copy a direct link to the current filters
File details
Details for the file strongly_connected_components-0.1.1.tar.gz.
File metadata
- Download URL: strongly_connected_components-0.1.1.tar.gz
- Upload date:
- Size: 20.2 kB
- Tags: Source
- Uploaded using Trusted Publishing? No
- Uploaded via: twine/6.1.0 CPython/3.13.3
File hashes
| Algorithm | Hash digest | |
|---|---|---|
| SHA256 |
baf8bb95ed2dc2d2e089be4f638acde4f4cea3d064f0eba09315c948ebd7aca9
|
|
| MD5 |
303bfaf8a18325c7eaa5ecb6fe7ddcc0
|
|
| BLAKE2b-256 |
11f4ffc5faaccc378ef31a76d7e60500f24bf181c051c749a3da995deecaa603
|
File details
Details for the file strongly_connected_components-0.1.1-py3-none-any.whl.
File metadata
- Download URL: strongly_connected_components-0.1.1-py3-none-any.whl
- Upload date:
- Size: 2.6 kB
- Tags: Python 3
- Uploaded using Trusted Publishing? No
- Uploaded via: twine/6.1.0 CPython/3.13.3
File hashes
| Algorithm | Hash digest | |
|---|---|---|
| SHA256 |
a241c52d77c3fed930c8eefb62504854dde1246e10530370345a8dee56548694
|
|
| MD5 |
244cce4165ddab09df59f8f3c08e5335
|
|
| BLAKE2b-256 |
b65187a185e59448353d4d43d0f6fba043c76db19ad0edead641aca5a817962b
|
