An android application with a map using Dijkstra's Shortest Path algorithm and A* algorithm

University Demonstration project - Need done as soon as possible!

Android application to find the shortest Path between 2 locations A and B using Dijsktra's algorithm and compare with A* algorithm.

Must be able to toggle between Dijkstra and A*.

Code must be fully documented and commented using Android Studio and Java to enable easy break down and explanation of classes used.

Must be able to relate a graph with edges and edge weights to the Map in the application.

This will be a concept for a gym application where 2 users can get the shortest path to a Gym between both users. For example "User 1" is at point "A" and "User 2" is at point "E", the gym is at point "C", so the application needs to show the shortest path to "C" for both users.

อัลกอริทึม Android Computer Science Google Maps API Java

หมายเลขโปรเจค: #15033965

เกี่ยวกับโปรเจกต์