At the core of Google Maps: Dijkstra's Algorithm

Google Maps and the other satellite routing apps are rooted in Network Science. They divide the problem of serving you the best route into smaller, simpler problems. These apps use large datasets to represent roads and streets as a graph, with intersections as nodes and road segments as edges. Then, they rely on an algorithm more than half a century old, that allows us to quickly calculate the shortest paths on graphs. Dijkstra's algorithm is at the very centre of how Google Maps works and at the very centre of this video. While Dijkstra's algorithm provides the shortest path on the graph, additional steps are necessary to determine the fastest directions. This is where big data comes into play. By leveraging real-time information on traffic congestion and incidents from a crowd-sourced network, the shortest path is transformed into the quickest one.

More about me: 👉 https://linktr.ee/erik_hormann
Let's connect: 👉   / erik_hormann  

Please let me know what you think of my videos in the #commentsection 👇 and #like 👍 #subscribe ▶️ and ring the #bell 🔔 to stay up-to-date with all the videos I release! Feel free to ask me any #question ⁉️

00:00 Intro
00:35 Road Modelling
03:00 Dijkstra's Algorithm
11:00 Traffic Modelling
12:47 Outro