1. Class Finder for Android
Justin Meidinger
Jed Storie
Erin Sanders

2. What is it Navigate the UW campus New students Visitors
People unfamiliar with campus
Building to building
Classroom to classroom

3. Android In general Open source Popular platform Personally
Common interest
Looking to expand knowledge base
Marketable skill
Java/XML

4. How it works User Select appropriate button
Select source and destination from drop down list
Select the button
Returns a map with a highlighted path from start to finish
Text directions
Ability to navigate between floors
Back button for new destination

5. How it Works Code Passed the source and destination from the UI
Dijkstra’s shortest paths algorithm
Data
Points and edges
Drawing between points

6. Algorithm Pick closest unknown vertex Add to list of know vertices
Update distances

7. dATA Stored data points in a vector
Determined coordinates of the point
Naming conventions
Added edges between connecting points
326 points
800 edges

8. Android functionality & DRAWING
Our Dijkstra’s Shortest Paths Algorithm outputs a list of vertices that denote the path
Each vertex has coordinate information stored in it
Drawn on android’s “canvas”
Implements scrolling and zooming using a gesture detector

11. Android functionality & DRAWING
Our Dijkstra’s Algorithm outputs a list of vertices that denote the path
Each vertex has coordinate information stored in it
Drawn on android’s “canvas”
Implements scrolling and zooming using a gesture detector

12. Future Implementations
All buildings
Extended Campus
Virtual Tour
Publishing

13. demo

14. references Dijkstra’s Algorithm Android Development
Android Development