Hespian / EdgeHierarchies
More Hierarchy in Route Planning Using Edge Hierarchies
☆15Updated 5 years ago
Alternatives and similar repositories for EdgeHierarchies:
Users that are interested in EdgeHierarchies are comparing it to the libraries listed below
- ☆17Updated last month
- KaGen: Communication-free Massively Distributed Graph Generators☆37Updated last month
- Dynamic Hashed Blocks (DHB) data structure for dynamic graphs☆12Updated 2 weeks ago
- Fast and highly tuned bit vector implementation including space efficient rank and select support having only 3.51% space overhead.☆29Updated last week
- KaTric: scalable distributed-memory triangle counting made in Karlsruhe☆13Updated last year
- Shared-Memory and Distributed-Memory Parallel Graph Partitioning☆38Updated this week
- Bumped Ribbon Retrieval and Approximate Membership Query☆43Updated 2 weeks ago
- This repository contains C++ source code used in several publications in the area of route planning.☆38Updated 3 years ago
- ☆9Updated 6 years ago
- Karlsruhe Rapid Ridesharing (KaRRi) Dynamic Taxi Sharing Dispatcher.☆12Updated this week
- Parallel Weighted Random Sampling☆19Updated 4 years ago
- Learned Monotone Minimal Perfect Hashing☆25Updated 2 weeks ago
- This is a header only library offering a variety of dynamically growing concurrent hash tables. That all work by dynamically migrating th…