Alternatives and similar repositories for EdgeHierarchies

Users that are interested in EdgeHierarchies are comparing it to the libraries listed below

• marvinwilliams / multiqueue
  ☆17Updated 2 months ago
• KarlsruheGraphGeneration / KaGen
  KaGen: Communication-free Massively Distributed Graph Generators
  ☆38Updated 3 weeks ago
• vbuchhold / routing-framework
  This repository contains C++ source code used in several publications in the area of route planning.
  ☆38Updated 3 years ago
• niklas-uhl / katric
  KaTric: scalable distributed-memory triangle counting made in Karlsruhe
  ☆13Updated last year
• hu-macsy / dhb
  Dynamic Hashed Blocks (DHB) data structure for dynamic graphs
  ☆12Updated 2 months ago
• stxxl / foxxll
  FOundation of stXXl and thriLL
  ☆14Updated last year
• KaHIP / KaMinPar
  Shared-Memory and Distributed-Memory Parallel Graph Partitioning
  ☆39Updated last week
• pasta-toolbox / bit_vector
  Fast and highly tuned bit vector implementation including space efficient rank and select support having only 3.51% space overhead.
  ☆30Updated last month
• ByteHamster / LeMonHash
  Learned Monotone Minimal Perfect Hashing
  ☆27Updated 2 months ago
• ByteHamster / PaCHash
  Packed and Compressed Hash Tables
  ☆15Updated last month
• molaupi / karri
  Karlsruhe Rapid Ridesharing (KaRRi) Dynamic Taxi Sharing Dispatcher.
  ☆12Updated last week
• kurpicz / pwm
  Parallel Wavelet Tree and Wavelet Matrix Construction
  ☆26Updated last year
• kittobi1992 / cluster_editing
  KaPoCE is a framework for solving the cluster editing problem that asks to transform an input graph into a cluster graph (a disjoint unio…
  ☆10Updated 2 years ago
• lorenzhs / BuRR
  Bumped Ribbon Retrieval and Approximate Membership Query
  ☆44Updated 2 weeks ago
• syhlalala / PAM-AE
  ☆9Updated 6 years ago
• kit-algo / InertialFlowCutter
  C++ implementation and evaluation for the InertialFlowCutter algorithm to compute Customizable Contraction Hierarchy orders.
  ☆12Updated 2 years ago
• KarlsruheMIS / pace-2019
  Winning Solver of PACE Challenge 2019 Track A
  ☆13Updated 3 years ago
• TooBiased / growt
  This is a header only library offering a variety of dynamically growing concurrent hash tables. That all work by dynamically migrating th…
  ☆109Updated 5 months ago
• kamping-site / kassert
  Powerful assertions made easy: Define assertion levels, get insights with expression decomposition, and switch between exceptions and ass…
  ☆11Updated 3 months ago
• TooBiased / DySECT
  Some near drop in stl compatible hash tables that are a lot more space efficient than any other options.
  ☆20Updated 2 years ago
• lorenzhs / ssssort
  Super Scalar Sample Sort in modern C++
  ☆20Updated 4 years ago
• Algebraic-Programming / ALP
  Home of ALP/GraphBLAS and ALP/Pregel, featuring shared- and distributed-memory auto-parallelisation of linear algebraic and vertex-centri…
  ☆25Updated this week
• LijunChang / Near-Maximum-Independent-Set
  Near-linear time algorithm for computing near-maximum independent set
  ☆18Updated 3 years ago
• VieClus / VieClus
  Vienna Graph Clustering
  ☆16Updated 4 months ago
• aplf / sdk2tree
  Code used in the paper "On dynamic succinct graph representations".
  ☆11Updated 3 years ago
• mloskot / spatial_index_benchmark
  Simple non-academic performance comparison of available open source implementations of R-tree spatial index using linear, quadratic and R…
  ☆47Updated 5 years ago
• gvinciguerra / la_vector
  🔶 Compressed bitvector/container supporting efficient random access and rank queries
  ☆43Updated 8 months ago
• lorenzhs / wrs
  Parallel Weighted Random Sampling
  ☆20Updated 4 years ago
• GVeitBatz / KaTCH
  KaTCH -- Karlsruhe Time-Dependent Contraction Hierarchies
  ☆77Updated 3 years ago
• omarobeya / parallel-inplace-radixsort
  ☆21Updated 4 years ago