Case study: Strava + Waze

Slides:

Advertisements

Similar presentations

Bellman-Ford algorithm

Advertisements

Traffic assignment.

1. Find the cost of each of the following using the Nearest Neighbor Algorithm. a)Start at Vertex M.

CS 206 Introduction to Computer Science II 04 / 01 / 2009 Instructor: Michael Eckmann.

CSE 390B: Graph Algorithms Based on CSE 373 slides by Jessica Miller, Ruth Anderson 1.

Nattee Niparnan. Distance of nodes  The distance between two nodes is the length of the shortest path between them S  A 1 S  C 1 S  B 2.

Graphs: MSTs and Shortest Paths David Kauchak cs161 Summer 2009.

Shortest paths in edge-weighted digraph Krasin Georgiev Technical University of Sofia g.krasin at gmail com Assistant Professor.

Internet Engineering Czesław Smutnicki Discrete Mathematics – Graphs and Algorithms.

D IJKSTRA ' S ALGORITHM By Laksman Veeravagu and Luis Barrera Edited by: Manuela Caicedo, Francisco Morales, Rafael Feliciano, and Carlos Jimenez.

CSC 331: Algorithm Analysis Paths in Graphs. The DFS algorithm we gave is recursive. DFS generates a search tree showing paths from one vertex to all.

1.End to end arguments in system design (1981) 2.Tussles in cyberspace: Defining Tomorrow’s Internet (2005) Nick McKeown CS244 Lecture 3 Architecture and.

CSCI 3160 Design and Analysis of Algorithms Tutorial 2 Chengyu Lin.

Shortest Paths and Dijkstra's Algorithm CS 110: Data Structures and Algorithms First Semester,

Def BFS(G, source): for v in G: color[v]

Data Structures and Algorithms1 Graphs 3 Adapted From: Data Structures and Their Algorithms, by Harry R. Lewis and Larry Denenberg (Harvard University:

D IJKSTRA ' S ALGORITHM By Laksman Veeravagu and Luis Barrera.

Using Dijkstra’s Algorithm to Find a Shortest Path from a to z 1.

Dijkstras Algorithm Named after its discoverer, Dutch computer scientist Edsger Dijkstra, is an algorithm that solves the single-source shortest path problem.

Dijkstra’s algorithm N: set of nodes for which shortest path already found Initialization: (Start with source node s) n N = {s}, D s = 0, “s is distance.

Graphs, BFS, DFS and More…

Dr. Naveed Ahmad Assistant Professor Department of Computer Science University of Peshawar.

Shortest Path Problem Weight of the graph –Nonnegative real number assigned to the edges connecting to vertices Weighted graphs –When a graph.

CSC-305 Design and Analysis of AlgorithmsBS(CS) -6 Fall-2014CSC-305 Design and Analysis of AlgorithmsBS(CS) -6 Fall-2014 Design and Analysis of Algorithms.

A graph problem: Maximal Independent Set Graph with vertices V = {1,2,…,n} A set S of vertices is independent if no two vertices in S are.

Shortest Path in Weighted Graph : Dijkstra’s Algorithm.

D IJKSTRA ' S ALGORITHM. S INGLE -S OURCE S HORTEST P ATH P ROBLEM Single-Source Shortest Path Problem - The problem of finding shortest paths from a.

Shortest Path Graph Theory Basics Anil Kishore.

Minimum spanning trees (MST) Def: A spanning tree of a graph G is an acyclic subset of edges of G connecting all vertices in G. A sub-forest of G is an.

Nattee Niparnan. Dijkstra’s Algorithm Graph with Length.

D IJKSTRA ’ S S INGLE S OURCE S HORTEST P ATH Informatics Department Parahyangan Catholic University.

Shortest Paths CSE 2320 – Algorithms and Data Structures Vassilis Athitsos University of Texas at Arlington 1.

Data Structures & Algorithms Shortest Paths Richard Newman based on book by R. Sedgewick and slides by S. Sahni.

Solving problems by searching Uninformed search algorithms Discussion Class CS 171 Friday, October, 2nd (Please read lecture topic material before and.

CS 367 Introduction to Data Structures Lecture 13.

CSE 373: Data Structures and Algorithms Lecture 21: Graphs V 1.

By Laksman Veeravagu and Luis Barrera

Shortest Paths and Minimum Spanning Trees

Lecture 13 Shortest Path.

Some applications of graph theory

Lecture 12 Graph Algorithms

Three Graph Algorithms

Network Routing.

Dynamic Programming in a nutshell

Graph Algorithm.

CSE 373: Data Structures and Algorithms

Solving TSP in O-Mopsi orienteering game Radu Mariescu-Istodor

Lecture 24 CSE 331 Oct 29, 2012.

Radu Mariescu-Istodor

Making Change Coins: 2 and

LAMAD Positioning technologies

Algorithms: Design and Analysis

Shortest Path Algorithm for Weighted Non-negative Undirected Graphs

Single Source Shortest Paths Dijkstra’s Alg. (no negative lengths!)

Weighted Graphs & Shortest Paths

Projections and distances

LAMAD Positioning technologies

CE 221 Data Structures and Algorithms

CSE 373 Data Structures and Algorithms

Dijkstra's Shortest Path Algorithm

Lecture 18: Implementing Graphs

CE 221 Data Structures and Algorithms

Lecture 12 Shortest Path.

The Shortest Path Algorithm

Lecture 14 Minimum Spanning Tree (cont’d)

Graphs: Shortest path and mst

Lecture 11 Graph Algorithms

Graph Algorithm.

Lecture 22: Implementing Dijkstra’s

Minimum-Cost Spanning Tree

Presentation transcript:

Case study: Strava + Waze LAMAD Case study: Strava + Waze Radu Mariescu-Istodor 14.11.2018

Strava: Segments

Waze: Dijkstra’s algorithm function Dijkstra(Graph, source): create vertex set Q for each vertex v in Graph: dist[v] ← INFINITY prev[v] ← UNDEFINED add v to Q dist[source] ← 0 while Q is not empty: u ← vertex in Q with min dist[u] remove u from Q for each neighbor v of u: alt ← dist[u] + length(u, v) if alt < dist[v]: dist[v] ← alt prev[v] ← u return dist[], prev[] https://www.wikipedia.org

Waze: Objective functions 100 m Shortest 2 km Shortest by car 3 km Is shortest really the needed important Turning speed into account