{"ref":"master","ref_type":"branch","master_branch":"master","description":"hladanie cesty v grafe, subory heap a graph boli zadane dopredu, my sme mali iba vyuzit uz zadany kod a naprogramovat Dijkstrov algoritmus","pusher_type":"user"}