TCNJmapping

Inspiration

We were inspired to challenge ourselves by implementing complex but useful algorithms.

What it does

This calculates the shortest path between two points on the TCNJ campus using both Dijkstra's and A* algorithm.

How we built it

We used Java 7, GDX Library, and the IntelliJ IDE.

Challenges we ran into

Implementing Dijkstra's algorithm was very troublesome and difficult to work with.

Accomplishments that we're proud of

Implementing the algorithms to a high level of success.

What we learned

We learned a significant amount about Java, GDX Library, the two pathfinding algorithms, and the importance of teamwork.

What's next for TCNJmapping

We hope to expand this piece of software to be able to find the shortest path between pre ordained points on a map, as opposed to user defined points.

Built With

• gdx
• intellij-idea
• java