GitHub repository: EachOneChew/Dijkstra-s-Algorithm
Primary language: Java
Created: 2020-01-03T03:57:18Z
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.