This repository contains C++ code for implementing various graph algorithms, including Dijkstra's algorithm for finding the shortest path between nodes in a graph. It also includes code for ...

This code generates a 32x32 Dijkstra Map based off of a 32x32 map of extra movement costs and walls. It's quick, it's dirty, and it's guaranteed not to be production ready. It also runs 1,000 ...