Implementation of the dynamic graph data structure described by Holm, de Lichtenberg and Thorup in 2001 (HDT 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:
FAQs
Implementation of the dynamic graph data structure described by Holm, de Lichtenberg and Thorup in 2001 (HDT algorithm).
We found that hdtgraph demonstrated a healthy version release cadence and project activity because the last version was released less than a year ago. It has 1 open source maintainer collaborating on the project.
Did you know?
Socket for GitHub automatically highlights issues in each pull request and monitors the health of all your open source dependencies. Discover the contents of your packages and block harmful activity before you install or update your dependencies.
Security News
CISOs are racing to adopt AI for cybersecurity, but hurdles in budgets and governance may leave some falling behind in the fight against cyber threats.
Research
Security News
Socket researchers uncovered a backdoored typosquat of BoltDB in the Go ecosystem, exploiting Go Module Proxy caching to persist undetected for years.
Security News
Company News
Socket is joining TC54 to help develop standards for software supply chain security, contributing to the evolution of SBOMs, CycloneDX, and Package URL specifications.
