Implementation of Dijkstra's algorithm to find a shortest path if it exists, implementation of a module to easily handle grid in the library
Implementation of an edge cost module based on integers
Implementation of A* algorithm