There are no reviews yet. Be the first to send feedback to the community and the maintainers!
ULTRA
UnLimited TRAnsfers for Efficient Multimodal Journey Planningrust_road_router
flow-cutter
Experimental FlowCutter CodeInertialFlowCutter
C++ implementation and evaluation for the InertialFlowCutter algorithm to compute Customizable Contraction Hierarchy orders.catchup
Paper, code, experiments and evaluation for ESA2020 paper "Space-efficient, Fast and Exact Routing in Time-dependent Road Networks"Bike-Sharing
Journey planning algorithms for multi-modal transportation networks with bike sharing.ULTRA-Trip-Based
Integrated variant of the ULTRA and Trip-Based algorithmsch_potentials
Source code for the CH-Potentials algorithm implementation and experimental evaluation of the SEA2021 paper "A Fast and Tight Heuristic for A* in Road Networks"temporalmaplabeling
The software framework accompanying "Temporal Map Labeling: A New Unified Framework with experiments"ULTRA-PHAST
One-to-many variant of ULTRALCD-cliques-experiments
Experimental Evaluation of "Local Community Detection based on Small Cliques"distributed_clustering_thrill
Distributed Graph Clustering using the experimental Thrill frameworkLCD-cliques-networkit
Fork of NetworKit containing the exact version used for the experiments of the paper "Local Community Detection based on Small Cliques". 2021 branch contains fixes for bugs discovered after the publication.HyperFlowCutter
Prototype implementation of the HyperFlowCutter algorithm and its refinement variant for hypergraph bipartitioning, accompanying our publication at ESA19tdpot
ConnectionBasedAssignment
TCPSPSuite
A software suite for optimizing various flavours of the Time Constrained Project Scheduling Problemfpt-editing
Implementation of exact F-free edge editing algorithmstraffic_aware
Fast Computation of Shortest Smooth Paths and Uniformly Bounded Stretch with Lazy RPHASTULTRA-Transfer-Time
Algorithms for fast multimodal journey planning with three criteriaLove Open Source and this site? Check out how you can help us