Alternatives and similar repositories for open-pls:

Users that are interested in open-pls are comparing it to the libraries listed below

• Hespian / EdgeHierarchies
  More Hierarchy in Route Planning Using Edge Hierarchies
  ☆15Updated 4 years ago
• hu-macsy / dhb
  Dynamic Hashed Blocks (DHB) data structure for dynamic graphs
  ☆12Updated 2 months ago
• kit-algo / flow-cutter
  Experimental FlowCutter Code
  ☆12Updated 5 years ago
• niklas-uhl / katric
  KaTric: scalable distributed-memory triangle counting made in Karlsruhe
  ☆13Updated last year
• KarlsruheGraphGeneration / KaGen
  KaGen: Communication-free Massively Distributed Graph Generators
  ☆35Updated last week
• molaupi / karri
  Karlsruhe Rapid Ridesharing (KaRRi) Dynamic Taxi Sharing Dispatcher.
  ☆12Updated this week
• marvinwilliams / multiqueue
  ☆16Updated 2 months ago
• vbuchhold / routing-framework
  This repository contains C++ source code used in several publications in the area of route planning.
  ☆38Updated 3 years ago
• kit-algo / InertialFlowCutter
  C++ implementation and evaluation for the InertialFlowCutter algorithm to compute Customizable Contraction Hierarchy orders.
  ☆12Updated last year
• KarlsruheMIS / KaMIS
  Maximum independent sets and vertex covers of large sparse graphs.
  ☆73Updated 2 months ago
• KarlsruheMIS / pace-2019
  Winning Solver of PACE Challenge 2019 Track A
  ☆13Updated 3 years ago
• omarobeya / parallel-inplace-radixsort
  ☆20Updated 3 years ago
• VieClus / VieClus
  Vienna Graph Clustering
  ☆15Updated this week
• KaHIP / KaHIP
  KaHIP -- Karlsruhe HIGH Quality Partitioning.
  ☆413Updated this week
• ips4o / ips2ra
  In-place Parallel Super Scalar Radix Sort (IPS²Ra)
  ☆30Updated this week
• syhlalala / PAM-AE
  ☆9Updated 6 years ago
• LijunChang / Near-Maximum-Independent-Set
  Near-linear time algorithm for computing near-maximum independent set
  ☆18Updated 2 years ago
• kamping-site / kassert
  Powerful assertions made easy: Define assertion levels, get insights with expression decomposition, and switch between exceptions and ass…
  ☆11Updated 2 months ago
• kurpicz / pwm
  Parallel Wavelet Tree and Wavelet Matrix Construction
  ☆26Updated last year
• ByteHamster / SicHash
  A (Minimal) Perfect Hash Function based on irregular cuckoo hashing, retrieval, and overloading.
  ☆17Updated last month
• bingmann / sqlplot-tools
  Generate pgfplots or gnuplots from embedded SQL statements
  ☆26Updated 5 months ago
• ips4o / ips4o
  In-place Parallel Super Scalar Samplesort (IPS⁴o)
  ☆116Updated this week
• 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
• ByteHamster / LeMonHash
  Learned Monotone Minimal Perfect Hashing
  ☆25Updated last month
• refresh-bio / RADULS
  Ultra fast MSD radix sorter
  ☆11Updated 4 years ago
• ParAlg / gbbs
  GBBS: Graph Based Benchmark Suite
  ☆202Updated last month
• GVeitBatz / KaTCH
  KaTCH -- Karlsruhe Time-Dependent Contraction Hierarchies
  ☆76Updated 3 years ago
• xxsds / sdsl-lite
  Succinct Data Structure Library 3.0
  ☆93Updated 4 months ago
• kit-algo / catchup
  Paper, code, experiments and evaluation for ESA2020 paper "Space-efficient, Fast and Exact Routing in Time-dependent Road Networks"
  ☆10Updated 3 years ago
• aldrichsun / Graph-Partitioning-with-Natural-Cuts
  Implementation of the graph partitioning algorithm described in paper "Graph Partitioning with Natural Cuts" in the 2011 IEEE Internation…
  ☆25Updated 8 years ago