A shortest-path via road calculator for any destination in Edmonton using Dijkstra's algorithm. Used with a microcontroller, a joystick, buttons, and an LCD display
-
Updated
Mar 19, 2019 - C++
A shortest-path via road calculator for any destination in Edmonton using Dijkstra's algorithm. Used with a microcontroller, a joystick, buttons, and an LCD display
Road network partitioning strategy for faster queries in recommender systems
This project consists of implementations of several kNN algorithms for road networks (aka finding nearest points of interest) and the experimental framework to compare them from a research paper published in PVLDB 2016. You can use it to add new methods and/or queries or reproduce our experimental results.
An abstract graph C++ library
MoRIS (Model of Routes of Invasive Spread). A simulator of human-mediated dispersal via transportation networks.
Fast map matching, an open source framework in C++
Add a description, image, and links to the road-network topic page so that developers can more easily learn about it.
To associate your repository with the road-network topic, visit your repo's landing page and select "manage topics."