Explain Dijkstra's algorithm at a high level, detailing how it works to find the shortest path from a starting point to all other reachable nodes in a GPS context. Your explanation should cover: The Goal, Core Idea, Key Components/Data Structures, Step-by-Step Process, Path Reconstruction, and Application to GPS. Focus on clarity and conciseness, avoiding overly technical jargon where possible, but maintaining accuracy. Assume the audience has a basic understanding of graphs.