Fast golang Dijkstra path finder
-
Updated
May 11, 2026 - Go
#
shortest-paths
Here are 7 public repositories matching this topic...
Contraction Hierarchies (with bidirectional version of Dijkstra's algorithm) technique for computing shortest path in graph.
graph osm pathfinding dijkstra isochrones shortest-paths breadth-first-search hacktoberfest dijkstra-algorithm shortest-path-algorithm isochrone-map contraction-hierarchies turn-restrictions hacktoberfest-accepted hactoberfest2022
-
Updated
Nov 29, 2025 - Go
Convert OSM-file to graph for contraction hierarchies
graph osm pathfinding dijkstra shortest-paths hacktoberfest dijkstra-algorithm shortest-path-algorithm contraction-hierarchies turn-restrictions
-
Updated
Jun 16, 2026 - Go
Finding paths of interest in networks
paths graphs computational-biology pathfinding networks shortest-paths signaling-pathways pathways signaling-networks network-analysis pathway-analysis graph-analysis biological-networks regulatory-networks upstream-paths downstream-paths pathway-tools
-
Updated
May 14, 2022 - Go
Dijkstra, Bellman-Ford shortest path algorithms
-
Updated
Jun 6, 2024 - Go
Connecting nodes
graph-algorithms graphs computational-biology pathfinding pathfinder networks shortest-paths network-analysis pathfinding-algorithms graph-analysis graph-traversal path-finding biological-networks network-algorithms networks-biology shortest-path-algorithm path-analysis biological-modeling regulatory-networks
-
Updated
Jul 10, 2019 - Go
Shortest path calculator using a bipartite to unipartite transformation and the Breadth First Search algorithm and exhaustive search algorithm
-
Updated
Feb 10, 2021 - Go
Add this topic to your repo
To associate your repository with the shortest-paths topic, visit your repo's landing page and select "manage topics."