HDT poly-logarithmic fully-dynamic connectivity algorithm
Implementation of the dynamic graph data structure described by Holm, de Lichtenberg and Thorup in 2001 (HDT algorithm).
The graph is represented as an ensemble of spanning forests where each spanning tree is stored as a balanced binary Euler tour tree. This enables connectivity queries in O(log n) as well as insertions and deletions in poly-logarithmic time.
References:
- Jacob Holm, Kristian de Lichtenberg, and Mikkel Thorup. Poly-logarithmic deterministic fully-dynamic algorithms for connectivity, minimum spanning tree, 2-edge, and biconnectivity. J. ACM, 48(4):723–760, July 2001.
- Monika Rauch Henzinger, Valerie King. Randomized fully dynamic graph algorithms with polylogarithmic time per operation. J. ACM 46(4) July 1999. 502–536.
1 maintainer
Metadata
1 maintainer
Release files for hdtgraph 0.0.1
For a detailed explanation of source distributions (sdists) and built distributions (wheels), please see the package formats documentation.
Source distribution (sdist)
| File | Size | Uploaded | Provenance | Actions |
|---|---|---|---|---|
| hdtgraph-0.0.1.tar.gz | 14.2 kB | Without provenance | Details for hdtgraph-0.0.1.tar.gz |
Built distribution (wheel)
| File | Interpreter | ABI | Platform | Actions Reset |
|---|---|---|---|---|
| hdtgraph-0.0.1-py3-none-any.whl | Python 3 | none | any | Details for hdtgraph-0.0.1-py3-none-any.whl |
Total release size: 31.4 kB
Release files / hdtgraph-0.0.1.tar.gz
| Download URL | hdtgraph-0.0.1.tar.gz |
|---|---|
| Size | 14.2 kB |
| Tags | Source |
|
SHA-256 checksum How to use checksums |
23ec31fe51436907bbed720ea17455fc327509e898d84d7f267e8400e0712780
|
|
BLAKE2b-256 checksum How to use checksums |
616b8453299329d9e45296683d8d086a9a15cb8749d7a7a379d1516b0ed4210b
|
| Upload date | |
|
Uploaded using Trusted Publishing? What is trusted publishing? |
No |
| Uploaded via |
twine/3.1.1 pkginfo/1.5.0.1 requests/2.22.0 setuptools/45.2.0 requests-toolbelt/0.9.1 tqdm/4.42.1 CPython/3.6.9
|
Release files / hdtgraph-0.0.1-py3-none-any.whl
| Download URL | hdtgraph-0.0.1-py3-none-any.whl |
|---|---|
| Size | 17.1 kB |
| Tags | Python 3 |
|
SHA-256 checksum How to use checksums |
9593afc052ab6125061cbd3cc5c6508247dbe774b155a36784c00e8aef40abed
|
|
BLAKE2b-256 checksum How to use checksums |
614190d3976d49c44b3daf48902a44f9455e76c414f63d0bf2b550d13af69c06
|
| Upload date | |
|
Uploaded using Trusted Publishing? What is trusted publishing? |
No |
| Uploaded via |
twine/3.1.1 pkginfo/1.5.0.1 requests/2.22.0 setuptools/45.2.0 requests-toolbelt/0.9.1 tqdm/4.42.1 CPython/3.6.9
|
Security for hdtgraph 0.0.1
Provenance
Provenance describes where a file came from. On PyPI, provenance is shared via attestations, which provide a verifiable record of the build or publishing details. View details, limitations and caveats.
No provenance found
None of the files in this release were uploaded with provenance metadata.
A note on package security
PyPI is a repository for distributing packages, not a service for auditing them. While third-party security researchers and our staff do their best to detect and remove malicious packages, PyPI cannot guarantee the quality, security or suitability of any given package.
To learn more about protecting yourself from malicious actors, visit our package security documentation.
