🚀 SmashThePath – Ultra-fast graph search API with optimized bidirectional / unidirectional pathfinding and heuristic acceleration for large-scale networks.
-
Updated
Mar 10, 2025 - C++
#
quickest-path
Here are 2 public repositories matching this topic...
Algorithm that can find the quickest path between two nodes of a 24M nodes graph within less than half of a second. Shaped as an A star algorithm, we added precomputation with landmarks to use heuristic. An optional version with a 2-threads parallelisation for both-end search had been implemented.
multi-threading algorithm graph optimization heuristic-search-algorithms a-star-algorithm parallelisation landmarks-estimation quickest-path
-
Updated
Feb 15, 2025 - C++
Improve this page
Add a description, image, and links to the quickest-path topic page so that developers can more easily learn about it.
Add this topic to your repo
To associate your repository with the quickest-path topic, visit your repo's landing page and select "manage topics."