Alternatives and similar repositories for pq-trees:

Users that are interested in pq-trees are comparing it to the libraries listed below

• KarlsruheGraphGeneration / KaGen
  KaGen: Communication-free Massively Distributed Graph Generators
  ☆37Updated this week
• Hespian / EdgeHierarchies
  More Hierarchy in Route Planning Using Edge Hierarchies
  ☆15Updated 4 years ago
• syhlalala / PAM-AE
  ☆9Updated 6 years ago
• stxxl / foxxll
  FOundation of stXXl and thriLL
  ☆14Updated last year
• dynatrace-research / set-sketch-paper
  SetSketch: Filling the Gap between MinHash and HyperLogLog
  ☆49Updated 3 years ago
• tetzank / SIMDSetOperations
  testbed for different SIMD implementations for set intersection and set union
  ☆41Updated 5 years ago
• omarobeya / parallel-inplace-radixsort
  ☆21Updated 3 years ago
• kurpicz / pwm
  Parallel Wavelet Tree and Wavelet Matrix Construction
  ☆26Updated last year
• dominikkempa / zip-tree
  C++ Implementation of Zip Trees
  ☆14Updated 2 years ago
• lorenzhs / BuRR
  Bumped Ribbon Retrieval and Approximate Membership Query
  ☆40Updated this week
• robert-sedgewick / hyperbitbit
  Official repository for the official implementation of HyperBitT, HyperBitBit64, and HyperTwoBits
  ☆14Updated 4 months ago
• gvinciguerra / la_vector
  🔶 Compressed bitvector/container supporting efficient random access and rank queries
  ☆43Updated 5 months ago
• mabseher / htd
  A small but efficient C++ library for computing (customized) tree and hypertree decompositions.
  ☆51Updated last year
• fclaude / libcds2
  Compact Data Structures Library
  ☆98Updated 2 years ago
• ot / path_decomposed_tries
  Implementation of the data structures described in the paper "Fast Compressed Tries using Path Decomposition".
  ☆55Updated 2 years ago
• graph-algorithms / edge-addition-planarity-suite
  ☆29Updated this week
• KaHIP / KaMinPar
  Shared-Memory and Distributed-Memory Parallel Graph Partitioning
  ☆39Updated this week
• hu-macsy / simexpal
  Simplifying Experimental Algorithmics
  ☆17Updated 3 months ago
• robmccoll / graphdb-testing
  Benchmarking various graph databases, engines, datastructures, and data stores.
  ☆35Updated 11 years ago
• wata-orz / fvs
  feedback vertex set solver
  ☆11Updated 6 years ago
• tkbtkysms / solca
  A Space-Optimal Grammar Compression
  ☆10Updated 4 years ago
• scipopt / soplex
  Sequential object-oriented simPlex
  ☆63Updated 2 weeks ago
• pasta-toolbox / bit_vector
  Fast and highly tuned bit vector implementation including space efficient rank and select support having only 3.51% space overhead.
  ☆29Updated 3 months ago
• puffinn / puffinn
  Parameterless and Universal FInding of Nearest Neighbors
  ☆59Updated 3 weeks ago
• KarlsruheMIS / KaMIS
  Maximum independent sets and vertex covers of large sparse graphs.
  ☆73Updated 3 months ago
• marvinwilliams / multiqueue
  ☆17Updated last month
• jermp / mutable_rank_select
  A SIMD-based C++ library providing rank/select queries over mutable bitmaps.
  ☆35Updated 2 years ago
• coin-or / CoinUtils
  COIN-OR Utilities
  ☆46Updated last week
• wbhart / ccas
  A simple CAS written in C.
  ☆10Updated 9 years ago
• ByteHamster / LeMonHash
  Learned Monotone Minimal Perfect Hashing
  ☆25Updated 3 months ago