Class Finder for Android

Slides:



Advertisements
Similar presentations
Bellman-Ford algorithm
Advertisements

VIP Smartphone Team – Ahmad, Din, Vinayak Car Locator App Fall 2010 VIP Smartphone Team Ahmad, Din, Vinayak.
CS 206 Introduction to Computer Science II 04 / 01 / 2009 Instructor: Michael Eckmann.
Weighted graphs Example Consider the following graph, where nodes represent cities, and edges show if there is a direct flight between each pair of cities.
CSE 390B: Graph Algorithms Based on CSE 373 slides by Jessica Miller, Ruth Anderson 1.
IKI 10100: Data Structures & Algorithms Ruli Manurung (acknowledgments to Denny & Ade Azurat) 1 Fasilkom UI Ruli Manurung (Fasilkom UI)IKI10100: Lecture10.
Data Structures and Algorithms Graphs Single-Source Shortest Paths (Dijkstra’s Algorithm) PLSD210(ii)
Design and Analysis of Algorithms Single-source shortest paths, all-pairs shortest paths Haidong Xue Summer 2012, at GSU.
All Pairs Shortest Paths and Floyd-Warshall Algorithm CLRS 25.2
Graph Algorithms: Minimum Spanning Tree We are given a weighted, undirected graph G = (V, E), with weight function w:
CSC 213 Lecture 23: Shortest Path Algorithms. Weighted Graphs Each edge in weighted graph has numerical weight Weights can be distances, building costs,
CS 206 Introduction to Computer Science II 11 / 10 / 2008 Instructor: Michael Eckmann.
1 Dijkstra's Shortest Path Algorithm Find shortest path from s to t. s 3 t
1 Dijkstra's Shortest Path Algorithm Find shortest path from s to t. s 3 t
Shortest path algorithm. Introduction 4 The graphs we have seen so far have edges that are unweighted. 4 Many graph situations involve weighted edges.
Shortest Path Algorithm By Weston Vu CS 146. What is Shortest Paths? Shortest Paths is a part of the graph algorithm. It is used to calculate the shortest.
Dijkstra’s Algorithm Slide Courtesy: Uwash, UT 1.
GTNavi System Hyojoon Kim, Sang Min Shim, Kai Wang, Pingping He CS8803 AIA, Spring 2009.
Using Dijkstra’s Algorithm to Find a Shortest Path from a to z 1.
Dijkstra’s Algorithm. 2 Shortest-path Suppose we want to find the shortest path from node X to node Y It turns out that, in order to do this, we need.
Shortest Path. Dijkstra’s Algorithm finds the shortest path from the start vertex to every other vertex in the network. We will find the shortest path.
Geography and CS Philip Chan. How do I get there? Navigation Which web sites can give you turn-by-turn directions?
Dijkstras Algorithm Named after its discoverer, Dutch computer scientist Edsger Dijkstra, is an algorithm that solves the single-source shortest path problem.
Tour Guide Customizable map guide and path finder. By Saurabh Zadgaonkar Cpsc 663.
Which of these can be drawn without taking your pencil off the paper and without going over the same line twice? If we can find a path that goes over all.
Shortest Path Problem Weight of the graph –Nonnegative real number assigned to the edges connecting to vertices Weighted graphs –When a graph.
© 2015 JW Ryder CSCI 203 Data Structures1. © 2015 JW Ryder CSCI 203 Data Structures2.
Shortest Path Navigation Application on GIS Supervisor: Dr. Damitha Karunaratne Thilani Imalka 2007/MCS/023.
Rapidly Exploring Random Trees for Path Planning: RRT-Connect
GLOBAL ROUTING Anita Antony PR11EC1011. Approaches for Global Routing Sequential Approach: – Route the nets one at a time. Concurrent Approach: – Consider.
A* Path Finding Ref: A-star tutorial.
Project 2 22C:021 Computer Science II : Data Structures.
Dijkstra animation. Dijksta’s Algorithm (Shortest Path Between 2 Nodes) 2 Phases:initialization;iteration Initialization: 1. Included:(Boolean) 2. Distance:(Weight)
Main Index Contents 11 Main Index Contents Graph Categories Graph Categories Example of Digraph Example of Digraph Connectedness of Digraph Connectedness.
Spanning Trees Dijkstra (Unit 10) SOL: DM.2 Classwork worksheet Homework (day 70) Worksheet Quiz next block.
Minimum Spanning Trees
Minimum Spanning Trees
Shortest Path from G to C Using Dijkstra’s Algorithm
Data Structures and Algorithms
Timeline, project outline and general features
Advisor: Professor Aura Ganz
Shortest Path Graph represents highway system Edges have weights
Why do Java programmers wear glasses?
Minimum Spanning Trees
Graph Algorithm.
Greedy Algorithms / Dijkstra’s Algorithm Yin Tat Lee
Shortest Path.
Shortest Path.
Missing Views Sections and of Text.
A* Path Finding Ref: A-star tutorial.
Yan Shi CS/SE 2630 Lecture Notes
Shortest Path Algorithms
Shortest path algorithm
Route Inspection Which of these can be drawn without taking your pencil off the paper and without going over the same line twice? If we introduce a vertex.
Slide Courtesy: Uwash, UT
Advanced Computer Networks
Navigating Campus Imagine yourself as a new student at UW, living in the McCarty dorms. On the first day of classes, you wake up late, scrambling to get.
Shortest Path Algorithm for Weighted Non-negative Undirected Graphs
Shortest Path.
Single Source Shortest Paths Dijkstra’s Alg. (no negative lengths!)
Weighted Graphs & Shortest Paths
Slide Courtesy: Uwash, UT
Chapter 16 1 – Graphs Graph Categories Strong Components
CSE 417: Algorithms and Computational Complexity
Dijkstra's Shortest Path Algorithm
Shortest Path Solutions
Prim’s algorithm for minimum spanning trees
Navigation By Touch מנחה הפרוייקט: כפיר לב-ארי.
Graph Algorithm.
Presentation transcript:

Class Finder for Android Justin Meidinger Jed Storie Erin Sanders

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

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

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

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

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

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

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

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

Future Implementations All buildings Extended Campus Virtual Tour Publishing

demo

references Dijkstra’s Algorithm Android Development http://www.cs.sunysb.edu/~skiena/combinatorica/animations/dijkstra.html Android Development http://developer.android.com/develop/index.html