This project implements Dijkstra's algorithm for finding the shortest path between two points on a 2D grid map. The algorithm can handle both cardinal (4-directional) and diagonal (8-directional) ...

You can create a release to package software, along with release notes and links to binary files, for other people to use. Learn more about releases in our docs.

There is a new sorting algorithm a deterministic O(m log2/3 n)-time algorithm for single-source shortest paths (SSSP) on directed graphs with real non-negative edge weights in the comparison-addition ...

Sometimes, wrapping your head around mathematical concepts can be tricky without a visual aid. Thankfully we have makers like Russell Eveleigh out there who are busy making beautiful Raspberry ...