Mapové vyhledávače a jejich algoritmy

This diploma paper, as it results from its title, it puts mind to map search engines and concerning algorithms. It describes two key algorithms, which solve the graph shortest path problem: Dijkstra's algorithm and Floyd-Warshall algorithm, which are specialized on solution procedure and running time of algorithms. A separate chapter is dedicated to map systems in GPS equipments. In the diploma paper the map search engines are described generally; it compares selected applications and examines how the shortest path problem is solved in practice with those applications -- searching for route in between two places on the map. The diploma paper describes the importance of geographic information systems generally, but particularly it concentrates on map services of GIS.