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
  ☆78Updated 4 years ago
• RoutingKit / RoutingKit
  RoutingKit is a C++ library that provides advanced route planning functionality.
  ☆398Updated last year
• michaelwegner / CRP
  C++ Implementation of Customizable Route Planning (CRP) by Delling et al.
  ☆118Updated 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
• kit-algo / ULTRA
  UnLimited TRAnsfers for Efficient Multimodal Journey Planning
  ☆76Updated last year
• vbuchhold / routing-framework
  This repository contains C++ source code used in several publications in the area of route planning.
  ☆38Updated 4 years ago
• Telenav / open-source-spec
  Open source experiences and profiles.
  ☆140Updated 2 years ago
• cetusteam / contraction-hierarchies
  ☆26Updated 5 years ago
• michaeltandy / contraction-hierarchies
  ☆37Updated 9 years ago
• kit-algo / rust_road_router
  ☆37Updated 2 years ago
• LdDl / ch
  Contraction Hierarchies (with bidirectional version of Dijkstra's algorithm) technique for computing shortest path in graph.
  ☆51Updated last year
• cyang-kth / osm_mapmatching
  A tutorial on map matching using OpenStreetMap data
  ☆149Updated 3 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
• 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
• zephyr-data-specs / GMNS
  General Modeling Network Specification
  ☆123Updated 2 weeks ago
• osmcode / libosmium
  Fast and flexible C++ library for working with OpenStreetMap data.
  ☆510Updated 2 months ago
• mapbox / cheap-ruler-cpp
  Fast approximations for common geodesic measurements
  ☆36Updated 5 years ago
• bmwcarit / offline-map-matching
  Matches a sequence of GPS coordinates to road segments
  ☆121Updated 4 years ago
• Universite-Gustave-Eiffel / Tempus
  C++ framework to develop multimodal path planning requests
  ☆77Updated 7 years ago
• kit-ifv / mobitopp
  ☆20Updated last year
• 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…
  ☆29Updated 9 years ago
• transnetlab / transit-routing
  Repository of algorithms and data for public transit routing
  ☆64Updated last year
• bmwcarit / hmm-lib
  Library for time-inhomogeneous Hidden Markov Models
  ☆93Updated 4 years ago
• amillb / pgMapMatch
  map-matching of GPS traces
  ☆83Updated 2 weeks ago
• cyang-kth / fmm
  Fast map matching, an open source framework in C++
  ☆986Updated last year
• movetk / movetk
  MoveTK is a library for computational movement analysis written in C++.
  ☆74Updated last year
• Tristramg / osm4routing
  Parse OpenStreetMap data for routing
  ☆111Updated 4 years ago
• kit-algo / flow-cutter
  Experimental FlowCutter Code
  ☆13Updated 6 years ago
• rust-transit / osm4routing2
  Extract a street network from Openstreetmap as a graph ready for routing
  ☆91Updated 3 months ago