arachid1/Dijkstra-Algorithm-Implementation

This project implements the Dijkstra algorithm to find the shortest path of an implemented maze while avoiding all obstacles.

Dijkstra’s shortest path algorithm