An intrusive C++17 implementation of a Red-Black-Tree, a Weight Balanced Tree, a Dynamic Segment Tree and much more!
-
Updated
Jun 5, 2023 - C++
An intrusive C++17 implementation of a Red-Black-Tree, a Weight Balanced Tree, a Dynamic Segment Tree and much more!
A C++ header only interval tree implementation.
Fast interval intersection library
A red-black self-balancing interval tree
Advance algorithm implementations
C++ implementations of real time dynamic planar convex hull construction algorithms.
C++ library for genomic region based storage and querying
c++ associative containers based on the XOR scapegoat tree
Trace intervals between genomes using a synteny map
Some advanced data structures' implementations in C++
Project πολυδιάστατων δομών ακαδημαϊκού έτους 2022-2023.
Implementation of commonly used algorithms and data structures in C++
c++ associative containers based on the scapegoat tree
C++ implementation of Nested Containment Lists and a demo comparison with an interval tree implementation
C++ Class for Efficiently Performing Interval Queries
Interval B+ Tree Library for C++
efficient interval tree implemention based on red-black tree, ref by "Introduction to Algorithms".
Cython-wrapped C++ red-black interval tree implementation
Advanced-Data-Structures Implementation in C++
Add a description, image, and links to the interval-tree topic page so that developers can more easily learn about it.
To associate your repository with the interval-tree topic, visit your repo's landing page and select "manage topics."