Skip to main content

Implementation of the dynamic graph data structure described by Holm, de Lichtenberg and Thorup in 2001 (HDT algorithm).

Project description

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.

Project details


Release history Release notifications

Download files

Download the file for your platform. If you're not sure which to choose, learn more about installing packages.

Files for hdtgraph, version 0.0.1
Filename, size File type Python version Upload date Hashes
Filename, size hdtgraph-0.0.1-py3-none-any.whl (17.1 kB) File type Wheel Python version py3 Upload date Hashes View
Filename, size hdtgraph-0.0.1.tar.gz (14.2 kB) File type Source Python version None Upload date Hashes View

Supported by

Pingdom Pingdom Monitoring Google Google Object Storage and Download Analytics Sentry Sentry Error logging AWS AWS Cloud computing DataDog DataDog Monitoring Fastly Fastly CDN DigiCert DigiCert EV certificate StatusPage StatusPage Status page