. . "13"^^ . . . . "2126"^^ . . . . "First fit je algoritmus z teorie graf\u016F. Je schopn\u00FD naj\u00EDt obarven\u00ED libovoln\u00E9ho grafu, nen\u00ED ale zaru\u010Deno, \u017Ee p\u016Fjde o obarven\u00ED minim\u00E1ln\u00ED, tedy pou\u017E\u00EDvaj\u00EDc\u00ED minim\u00E1ln\u00ED pot\u0159ebn\u00FD po\u010Det r\u016Fzn\u00FDch barev. Jedn\u00E1 se o tzv. hladov\u00FD algoritmus."@cs . . "16164685"^^ . "First fit je algoritmus z teorie graf\u016F. Je schopn\u00FD naj\u00EDt obarven\u00ED libovoln\u00E9ho grafu, nen\u00ED ale zaru\u010Deno, \u017Ee p\u016Fjde o obarven\u00ED minim\u00E1ln\u00ED, tedy pou\u017E\u00EDvaj\u00EDc\u00ED minim\u00E1ln\u00ED pot\u0159ebn\u00FD po\u010Det r\u016Fzn\u00FDch barev. Jedn\u00E1 se o tzv. hladov\u00FD algoritmus."@cs . . . . . . . "First fit algoritmus barven\u00ED grafu"@cs . . "1296604"^^ .