Antud on graaf naabrusmaatriksiga: 0 59 54 9 68 33 59 0 53 94 92 96 54 53...
✅ The verified answer to this question is available below. Our community-reviewed solutions help you understand the material better.
Antud on graaf naabrusmaatriksiga:
0 59 54 9 68 33 59 0 53 94 92 96 54 53 0 43 32 34 9 94 43 0 85 98 68 92 32 85 0 37 33 96 34 98 37 0 Sellele graafile rakendatakse Dijkstra algoritmi.Milline on massiivi parent[] seis pärast algoritmi rakendamist? Tipud on indekseeritud [1 .. 6] ning lähimaid teid otsitakse tipust indeksiga 1.Esitage alates indeksist 2 selle massiivi elemendid pärast algoritmi lõpetamist, eraldades need tühikutega: parent[2] parent[3] parent[4] parent[5] parent[6]
Want instant access to all verified answers on moodle.taltech.ee?
Get Unlimited Answers To Exam Questions - Install Crowdly Extension Now!