GitHub / Anurag-kuswaha / Advance-Shortest-Path

. implement Bidirectional Dijkstra and use it to compute distances in social networks very quickly; 2. implement A* search algorithm and apply it to compute distances in road networks faster than the classic algorithms do; 3. implement Contraction Hierarchies algorithm and apply it to preprocess large road networks and then compute distances in them much faster;

JSON API: https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Anurag-kuswaha%2FAdvance-Shortest-Path

Topics: astar-algorithm, astar-search-algorithm, bidirectional-dijkstra, compute-distances, contraction-hierarchies-algorithm, road-networks, social-networks

Files

No dependencies found