Antud on graaf naabrusmaatriksiga: 0 96 30 63 29 46 96 0 65 8 97 87 30 65...
✅ The verified answer to this question is available below. Our community-reviewed solutions help you understand the material better.
Antud on graaf naabrusmaatriksiga:
0 96 30 63 29 46 96 0 65 8 97 87 30 65 0 32 58 92 63 8 32 0 99 5 29 97 58 99 0 9 46 87 92 5 9 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!