MakeDijkstraGrid initializes a 2D grid of dijkstraNodes with distances initialized to the max safe integer.

MakeGraph initializes a Graph instance and returns a pointer to it.

DijkstraGrid stores the grid itself and also the needed queue to traverse through the grid.

Graph stores the edges between keys by storing all paths from a particular key to all other keys all cells in this 2D MAP will be a dijkstraNode because those contain all the needed data such as distance from last key, the keysNeeded to take this path.