Automatically exported from code.google.com/p/preach2014

TKDE 2017/Reachability Querying: Can It Be Even Faster?

Fast shortest-path distance querying on road networks

A parallel approach to the problem of answering shortest path queries.

A date and time library based on the C++11/14/17 <chrono> header

Fast and exact shortest-path distance querying index

A Toolkit for Programming Parallel Algorithms on Shared-Memory Multicore Machines

Parsing gigabytes of JSON per second : used by Facebook/Meta Velox, the Node.js runtime, ClickHouse, WatermelonDB, Apache Doris, Milvus, StarRocks

A very fast hashtable

Mt-KaHyPar (Multi-Threaded Karlsruhe Hypergraph Partitioner) is a shared-memory multilevel graph and hypergraph partitioner equipped with parallel implementations of techniques used in the best seq…

In this project, serial and parallel version of bellman ford algorithm for single source shortest path is implemented

Distance Closures: Unifying Search- and Lookup-based Shortest Path Speedup Techniques

In-place Parallel Super Scalar Samplesort (IPS⁴o)

Single-header c++ code profiler

A tool for checking, sanitizing and minimizing GTFS feeds.

Google's Operations Research tools:

C++ implementation and evaluation for the InertialFlowCutter algorithm to compute Customizable Contraction Hierarchy orders.

Experimental FlowCutter Code

Karlsruhe Rapid Ridesharing (KaRRi) Dynamic Taxi Sharing Dispatcher.

Software suite for the automated generation of geographically correct or schematic transit maps.

Precise map-matching for public transit feeds. Generates high-quality GTFS shapes from OSM data.

Network Analysis in Python

multimodal routing, geocoding, and map tiles

An open source multi-modal trip planner

Hub Labeling Algorithms Implementation

RoutingKit is a C++ library that provides advanced route planning functionality.