/Fastest-way-around-FIU

This project consists of a map GUI that uses an implication of Dijkstra's algorithm to calculate the shortest path between two buildings in the FIU MMC campus. Note that this project can be repurposed for other sets of buildings if the position and paths between the buildings are known.

Primary LanguageJava

Stargazers