GVeitBatz / KaTCHView external linksLinks
KaTCH -- Karlsruhe Time-Dependent Contraction Hierarchies
☆79Aug 6, 2021Updated 4 years ago
Alternatives and similar repositories for KaTCH
Users that are interested in KaTCH are comparing it to the libraries listed below
Sorting:
- C++ implementation and evaluation for the InertialFlowCutter algorithm to compute Customizable Contraction Hierarchy orders.☆15Apr 18, 2023Updated 2 years ago
- Paper, code, experiments and evaluation for ESA2020 paper "Space-efficient, Fast and Exact Routing in Time-dependent Road Networks"☆11Mar 12, 2021Updated 4 years ago
- ☆27Nov 29, 2019Updated 6 years ago
- RoutingKit is a C++ library that provides advanced route planning functionality.☆409Feb 1, 2026Updated 2 weeks ago
- More Hierarchy in Route Planning Using Edge Hierarchies☆14Mar 4, 2020Updated 5 years ago
- C++ Implementation of Customizable Route Planning (CRP) by Delling et al.☆121Apr 29, 2016Updated 9 years ago
- This repository contains C++ source code used in several publications in the area of route planning.☆39Jun 11, 2021Updated 4 years ago
- FlowCutter submission to PACE 2016☆12Sep 20, 2016Updated 9 years ago
- Vienna Graph Clustering☆17Nov 12, 2025Updated 3 months ago
- C++ framework to develop multimodal path planning requests☆77Jun 8, 2018Updated 7 years ago
- Java Code for Contraction Hierarchies Algorithm, A-Star Algorithm and Bidirectional Dijkstra Algorithm. Tested and Verified Code.☆80May 27, 2018Updated 7 years ago
- This the open source graph drawing package KaDraw (Karlsruhe Graph Drawing).☆11Jan 8, 2024Updated 2 years ago
- Multi-platform topology-aware memory management library☆13Apr 23, 2020Updated 5 years ago
- FOundation of stXXl and thriLL☆14Jan 24, 2024Updated 2 years ago
- Scary-Fast Pathfinding for NodeJS and the Browser using Contraction Hierarchies☆15Nov 11, 2025Updated 3 months ago
- UnLimited TRAnsfers for Efficient Multimodal Journey Planning☆80Jan 14, 2026Updated last month
- Implementation of algorithms that extend IPF to nested structures☆14Jan 14, 2026Updated last month
- Clone☆11Nov 23, 2015Updated 10 years ago
- KaTric: scalable distributed-memory triangle counting made in Karlsruhe☆14Sep 5, 2023Updated 2 years ago
- ☆12Aug 9, 2016Updated 9 years ago
- compressed, queryable variation graphs☆11Jun 25, 2015Updated 10 years ago
- KaHIP -- Karlsruhe HIGH Quality Partitioning.☆473Jan 23, 2026Updated 3 weeks ago
- Open source experiences and profiles.☆142Sep 13, 2023Updated 2 years ago
- Library for time-inhomogeneous Hidden Markov Models☆96Aug 24, 2021Updated 4 years ago
- A shortest path router for Open Street Maps☆15Jan 14, 2018Updated 8 years ago
- Dynamic succinct/compressed data structures☆115Dec 17, 2025Updated last month
- Fast approximations for common geodesic measurements☆36May 22, 2020Updated 5 years ago
- ☆16Jun 19, 2014Updated 11 years ago
- ST-Hadoop is an open-source MapReduce extension of Hadoop designed specially to analyze your spatio-temporal data efficiently☆23Mar 1, 2019Updated 6 years ago
- Finding the Time-Dependent Shortest Path over Large Graphs in Python☆19Oct 29, 2018Updated 7 years ago
- Fast shortest-path distance querying on road networks☆22Nov 4, 2015Updated 10 years ago
- Maximum independent sets and vertex covers of large sparse graphs.☆79Jan 29, 2026Updated 2 weeks ago
- Gradient Boosting Models on Real-Time Sensor Data for AI-Enhanced Vehicle Predictive Maintenance. By using a web-based interface to forec…☆19Nov 17, 2024Updated last year
- ☆17Updated this week
- Graph edge partitioning algorithms☆48Oct 17, 2019Updated 6 years ago
- Experimental Code for "Unleashing Graph Partitioning for Large-Scale Nearest Neighbor Search"☆27Nov 4, 2024Updated last year
- Pandas Network Analysis by UrbanSim: fast accessibility metrics and shortest paths, using contraction hierarchies☆412Nov 25, 2023Updated 2 years ago
- A Web-Based Visualization Tool for Biclustering of Multivariate Time Series☆10Feb 17, 2023Updated 2 years ago
- Tool to inspect matching generated by the road-network matching plugin in OSRM☆25Mar 24, 2023Updated 2 years ago