Graaf on esitatud naabrusmaatriksiga: 0 1 1 1 0 1 1 0 0 1 1 0 1 0 0 0 0 0 ...
✅ The verified answer to this question is available below. Our community-reviewed solutions help you understand the material better.
Graaf on esitatud naabrusmaatriksiga:
0 1 1 1 0 1 1 0 0 1 1 0 1 0 0 0 0 0 1 1 0 0 0 0 0 1 0 0 0 1 1 0 0 0 1 0
Graaf läbitakse sügavuti otsingu (DFS) algoritmiga.Milline on tippude visited saamise järjekord?Tipud on indekseeritud [0 .. 5].Graafi läbimist alustatakse tipust indeksiga 0. Naabrite valikul valitakse enne väiksema indeksiga naaber.Esitage tippude indeksid visited saamise järjekorras eraldades need tühikutega.
Want instant access to all verified answers on moodle.taltech.ee?
Get Unlimited Answers To Exam Questions - Install Crowdly Extension Now!