Alternatives and similar repositories for InertialFlowCutter

Users that are interested in InertialFlowCutter are comparing it to the libraries listed below

• GVeitBatz / KaTCH
  KaTCH -- Karlsruhe Time-Dependent Contraction Hierarchies
  ☆79Updated 4 years ago
• RoutingKit / RoutingKit
  RoutingKit is a C++ library that provides advanced route planning functionality.
  ☆408Updated last week
• vbuchhold / routing-framework
  This repository contains C++ source code used in several publications in the area of route planning.
  ☆39Updated 4 years ago
• michaelwegner / CRP
  C++ Implementation of Customizable Route Planning (CRP) by Delling et al.
  ☆121Updated 9 years ago
• kit-algo / catchup
  Paper, code, experiments and evaluation for ESA2020 paper "Space-efficient, Fast and Exact Routing in Time-dependent Road Networks"
  ☆11Updated 4 years ago
• Telenav / open-source-spec
  Open source experiences and profiles.
  ☆142Updated 2 years ago
• cetusteam / contraction-hierarchies
  ☆27Updated 6 years ago
• kit-algo / ULTRA
  UnLimited TRAnsfers for Efficient Multimodal Journey Planning
  ☆80Updated 3 weeks ago
• kit-algo / rust_road_router
  ☆38Updated 2 years ago
• ben-strasser / flow-cutter-pace16
  FlowCutter submission to PACE 2016
  ☆12Updated 9 years ago
• michaeltandy / contraction-hierarchies
  ☆38Updated 9 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…
  ☆30Updated 9 years ago
• mapbox / cheap-ruler-cpp
  Fast approximations for common geodesic measurements
  ☆36Updated 5 years ago
• Hespian / EdgeHierarchies
  More Hierarchy in Route Planning Using Edge Hierarchies
  ☆14Updated 5 years ago
• navjindervirdee / Advanced-Shortest-Paths-Algorithms
  Java Code for Contraction Hierarchies Algorithm, A-Star Algorithm and Bidirectional Dijkstra Algorithm. Tested and Verified Code.
  ☆80Updated 7 years ago
• LdDl / ch
  Contraction Hierarchies (with bidirectional version of Dijkstra's algorithm) technique for computing shortest path in graph.
  ☆54Updated 2 months ago
• jagodki / Offline-MapMatching
  a QGIS-plugin for matching a trajectory with a network using a Hidden Markov Model and Viterbi algorithm
  ☆173Updated 5 years ago
• kit-algo / flow-cutter
  Experimental FlowCutter Code
  ☆13Updated 6 years ago
• kit-ifv / mobitopp
  ☆21Updated 2 weeks ago
• bmwcarit / offline-map-matching
  Matches a sequence of GPS coordinates to road segments
  ☆124Updated 4 years ago
• bmwcarit / hmm-lib
  Library for time-inhomogeneous Hidden Markov Models
  ☆95Updated 4 years ago
• Universite-Gustave-Eiffel / Tempus
  C++ framework to develop multimodal path planning requests
  ☆77Updated 7 years ago
• osmcode / libosmium
  Fast and flexible C++ library for working with OpenStreetMap data.
  ☆533Updated 3 weeks ago
• bliksemlabs / rrrr
  RRRR rapid real-time routing
  ☆173Updated 5 years ago
• mk-fg / trip-based-public-transit-routing-algo
  Python implementation of Trip-Based public transit routing algorithm
  ☆51Updated 8 years ago
• bcgov / ols-router
  BC Advanced Route Planner
  ☆23Updated 6 months ago
• cyang-kth / osm_mapmatching
  A tutorial on map matching using OpenStreetMap data
  ☆152Updated 4 years ago
• addy90 / map-matching-2
  High Performance Map Matching with Markov Decision Processes (MDPs) and Hidden Markov Models (HMMs).
  ☆85Updated 4 months ago
• transnetlab / transit-routing
  Repository of algorithms and data for public transit routing
  ☆73Updated last year
• julienperret / mapmatcher
  A simple map matching library using the Hidden-Markov Model Map Matching algorithm (HMM Map Matching) from Paul Newson and John Krumm, "H…
  ☆29Updated 9 years ago