Antud on graaf naabrusmaatriksiga: 0 97 31 65 13 28 97 0 37 89 84 85 31 3...
✅ The verified answer to this question is available below. Our community-reviewed solutions help you understand the material better.
Antud on graaf naabrusmaatriksiga:
0 97 31 65 13 28 97 0 37 89 84 85 31 37 0 57 86 69 65 89 57 0 33 2 13 84 86 33 0 36 28 85 69 2 36 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!