Graaf on esitatud naabruslistina: Node 0 -> [2, 4, 7, 8, 9] Node 1 -> [2, 3...
✅ The verified answer to this question is available below. Our community-reviewed solutions help you understand the material better.
Graaf on esitatud naabruslistina:
Node 0 -> [2, 4, 7, 8, 9]
Node 1 -> [2, 3, 5, 6, 7]
Node 2 -> [3, 5, 6, 8]
Node 3 -> [5, 7]
Node 4 -> [5, 8, 9]
Node 5 -> [6, 7, 8, 9]
Node 6 -> [9]
Node 7 -> []
Node 8 -> [9]
Node 9 -> []
Millise järjestuse annab antud graafi topoloogiline sorteerimine? Graafi läbimist alustatakse tipust indeksiga 0. Naabrite valikul valitakse enne väiksema indeksiga naaber. Andke vastus arvude jadana, kasutades arvude eraldajatena tühikuid.
Want instant access to all verified answers on moodle.taltech.ee?
Get Unlimited Answers To Exam Questions - Install Crowdly Extension Now!