You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
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.
A small application that, using my Theta library as the graphical component, lets users draw undirected graphs and find the shortest path using Dijkstra's algorithm.