This Python project implements a pathfinding algorithm using Dijkstra's algorithm to find the shortest path between two points in a maze-like environment. The maze is represented as a matrix, and the ...

Dijkstra and A* take the weight of the fields on the map into account. If you are still using python 2 take a look at the (unmaintained) python2-branch. For usage examples with detailed descriptions ...