Earlier this week we found a video that talks about the algorithm that Google Maps uses. We were inspired by this algorithm to make our own program.

What it does

Our program finds the shortest route to take between locations on user generated maps.

How we built it

With the inspiration from the video, we came up with the idea for the project and immediately created a flowchart. This is a flowchart of the commands we initially planned to implement, most of which we did, though the structure of the code made some parts unnecessary.

Challenges we ran into

Some challenges we ran into were implementation of Dijkstra's mapping algorithm, parsing commands to call procedures, and storage of maps in a custom file format.

Accomplishments that we're proud of

some accomplishments we are proud of are our use of file manipulation to generate custom map files and our development of a Command Line Interface (CLI).

What we learned

We learned about managing objects as linked lists, file manipulation, and Java graphics. We also learned how to work better as a team by creating a game plan and flowchart of jobs for each team member to accomplish to work towards our goal.

What's next for ARG

The next thing that can be accomplished in ARG is the upgrade of Dijkstra's algorithm to the A* algorithm. After that, we would create a map using graphics that displays a grid with the marked coordinate locations. We can also add more versatile commands, instead of a strict more computer readable construction we use for ARG.

Built With

Share this project: