Antud on graaf naabrusmaatriksiga: 0 50 10 68 35 13 50 0 55 61 85 2 10 55...
✅ The verified answer to this question is available below. Our community-reviewed solutions help you understand the material better.
Antud on graaf naabrusmaatriksiga:
0 50 10 68 35 13 50 0 55 61 85 2 10 55 0 66 84 49 68 61 66 0 27 83 35 85 84 27 0 38 13 2 49 83 38 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!