. . . "29"^^ . "14406625"^^ . "Praha"@cs . . . "80"^^ . "On the History of the Minimum Spanning Tree Problem"@cs . . . . . . "Pavol"@cs . . "Kruskalova algoritmu"@cs . "Graham"@cs . . "PDF"@cs . . "Kruskal\u016Fv algoritmus"@cs . . "14802"^^ . . . . . . . . . . . "Kruskal\u016Fv algoritmus"@cs . . "Josef"@cs . "\u010Cesk\u00E1 informatick\u00E1 spole\u010Dnost"@cs . . "1985"^^ . . . "102"^^ . "leden-b\u0159ezen"@cs . "Ronald Lewis"@cs . . . "Hell"@cs . "7"^^ . "anglicky"@cs . "10.1109"^^ . "Kruskal\u016Fv algoritmus (v \u010Cesk\u00E9 republice se n\u011Bkdy myln\u011B zam\u011B\u0148uje s Bor\u016Fvkov\u00FDm algoritmem, ten ale funguje odli\u0161n\u011B) je jeden z algoritm\u016F vyu\u017E\u00EDvan\u00FDch v teorii graf\u016F k nalezen\u00ED minim\u00E1ln\u00ED kostry grafu, jeho\u017E hrany maj\u00ED nez\u00E1porn\u00E9 ohodnocen\u00ED (d\u00E9lku). U souvisl\u00E9ho grafu hled\u00E1 podmno\u017Einu hran, kter\u00E1 tvo\u0159\u00ED strom obsahuj\u00EDc\u00ED v\u0161echny uzly, s t\u00EDm, \u017Ee celkov\u00E1 v\u00E1ha (sou\u010Det d\u00E9lek) hran grafu je minim\u00E1ln\u00ED."@cs . . "Teoretick\u00E1 informatika"@cs . "43"^^ . . . . "Annals of the History of Computing, IEEE"@cs . "5"^^ . . . . . "1058"^^ . "2004"^^ . "12"^^ . . . "Kol\u00E1\u0159"@cs . "33846"^^ . . . "Kruskal\u016Fv algoritmus (v \u010Cesk\u00E9 republice se n\u011Bkdy myln\u011B zam\u011B\u0148uje s Bor\u016Fvkov\u00FDm algoritmem, ten ale funguje odli\u0161n\u011B) je jeden z algoritm\u016F vyu\u017E\u00EDvan\u00FDch v teorii graf\u016F k nalezen\u00ED minim\u00E1ln\u00ED kostry grafu, jeho\u017E hrany maj\u00ED nez\u00E1porn\u00E9 ohodnocen\u00ED (d\u00E9lku). U souvisl\u00E9ho grafu hled\u00E1 podmno\u017Einu hran, kter\u00E1 tvo\u0159\u00ED strom obsahuj\u00EDc\u00ED v\u0161echny uzly, s t\u00EDm, \u017Ee celkov\u00E1 v\u00E1ha (sou\u010Det d\u00E9lek) hran grafu je minim\u00E1ln\u00ED. V p\u0159\u00EDpad\u011B grafu o v\u00EDce komponent\u00E1ch, algoritmus hled\u00E1 les minim\u00E1ln\u00EDch koster, tedy minim\u00E1ln\u00ED kostru ka\u017Ed\u00E9 komponenty. Kruskal\u016Fv algoritmus je p\u0159\u00EDkladem hladov\u00E9ho algoritmu."@cs . "1"^^ .