GitHub repository: EachOneChew/Dijkstra-s-Algorithm-FEH
Primary language: Java
Description: A tentative approach of implementing Dijkstra's Algorithm to find the shortest route between two points on a grid, tailored specifically for 2d arrays representing FEH maps. This will be useful for calculating the "distance to closest enemy" value in my FEH AI Simulator.