Skip to content
#

landmarks-estimation

Star

Here is 1 public repository matching this topic...

algosup / 2024-2025-project-3-quickest-path-team-7

Star 4

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 landmarks-estimation topic page so that developers can more easily learn about it.

Curate this topic

Add this topic to your repo

To associate your repository with the landmarks-estimation topic, visit your repo's landing page and select "manage topics."

Learn more