Using Dijkstra's algorithm ("finding the shortest paths between nodes in a graph") to draw maps 🌍.
-
Updated
Oct 27, 2016 - C++
Using Dijkstra's algorithm ("finding the shortest paths between nodes in a graph") to draw maps 🌍.
Add a description, image, and links to the dijkstra-cartography topic page so that developers can more easily learn about it.
To associate your repository with the dijkstra-cartography topic, visit your repo's landing page and select "manage topics."