Bp 513 en

Z DCEwiki
Verze z 24. 1. 2018, 13:16, kterou vytvořil Petrasva (diskuse | příspěvky) (Založena nová stránka s textem „This bachelor thesis deals with route planning algorithms and their applications for fast search of paths on grid maps. The thesis is divided into two part…“)
(rozdíl) ← Starší verze | zobrazit aktuální verzi (rozdíl) | Novější verze → (rozdíl)
Skočit na navigaci Skočit na vyhledávání

This bachelor thesis deals with route planning algorithms and their applications for fast search of paths on grid maps. The thesis is divided into two parts. The first part describes the basic algorithms for finding the shortest paths in the general graphs and on the grid maps. The second part deals with the implementation and testing of a specific algorithm for fast search of paths on a grid map.