This respitory contains code samples of classical graph theory algorithms, some were just copied from other GitHub respositories, and OLNY for learning. and they will be removed in the future.
Footnotes
[1] | Introduction to A* (Animated) |
[2] | Introduction to A* Algorithm |
[3] | A* Demonstration |
[4] | Pathfinding for tower defence |
[5] | Recastnavigation - a C++ implementation |
[6] | A* implementation |
[7] | Easystar - javascript version |
[8] | Simple C++ version |
[9] | Simple Java version |
[10] | Respository with different benchmark |
[11] | Algorithm benchmark sets |
[12] | An orelly book Respository with graph theory |
[13] | OSRM-Backend |
[14] | Shortest Paths Algorithms in JAVA <https://github.com/navjindervirdee/Advanced-Shortest-Paths-Algorithms.git> |
[15] | OpenStreetMap downnload |
[16] | Cool visualization - geojson.io |
[17] | libosmium - A fast and flexible C++ library for working with OpenStreetMap data |
[18] | Graphhopper - A Java-based routing project |