added example 5.3_15

5b91ea35 · Vít Novotný · ad4cea4a · 5b91ea35
Commit 5b91ea35 authored Jan 24, 2017 by Vít Novotný
--- a/4.1_9-priority-queue.py.out
+++ b/4.1_9-priority-queue.py.out
-Best-First Search (algoritmus A*)
+Best-First Search (algoritmus A*) - implementace pomoci prioritni fronty
 Veskere jednoduche cesty mezi mesty Arad a Bukurest serazene vzestupne podle ceny:
 (418, ['Bukurest', 'Pitesti', 'Rimnicu_Vilcea', 'Sibiu', 'Arad'])
 (450, ['Bukurest', 'Fagaras', 'Sibiu', 'Arad'])