This document discusses shortest path algorithms. It begins with the Konigsberg bridge problem solved by Euler that helped develop graph theory. It then discusses the shortest path problem in graph theory and two algorithms to solve it: Dijkstra's algorithm and the A* search algorithm. It explains how these algorithms work and their applications, such as in map routing, network routing, games development, and more.