Antud on graaf naabrusmaatriksiga: 0 27 63 93 80 4 27 0 65 3 97 47 63 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 27 63 93 80 4 27 0 65 3 97 47 63 65 0 76 7 45 93 3 76 0 18 16 80 97 7 18 0 96 4 47 45 16 96 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!