<http://cs.dbpedia.org/resource/Floyd\u016Fv\u2013Warshall\u016Fv_algoritmus>	<http://dbpedia.org/ontology/wikiPageWikiLink>	<http://cs.dbpedia.org/resource/Po\u010D\u00EDta\u010D> .
<http://cs.dbpedia.org/resource/Floyd\u016Fv\u2013Warshall\u016Fv_algoritmus>	<http://dbpedia.org/ontology/wikiPageWikiLink>	<http://cs.dbpedia.org/resource/Dijkstr\u016Fv_algoritmus> .
<http://cs.dbpedia.org/resource/Floyd\u016Fv\u2013Warshall\u016Fv_algoritmus>	<http://purl.org/dc/terms/subject>	<http://cs.dbpedia.org/resource/Kategorie:Grafov\u00E9_algoritmy> .
<http://cs.dbpedia.org/resource/Floyd\u016Fv\u2013Warshall\u016Fv_algoritmus>	<http://dbpedia.org/ontology/wikiPageExternalLink>	<http://networkx.lanl.gov/> .
<http://cs.dbpedia.org/resource/Floyd\u016Fv\u2013Warshall\u016Fv_algoritmus>	<http://dbpedia.org/ontology/wikiPageWikiLink>	<http://cs.dbpedia.org/resource/Johnson\u016Fv_algoritmus> .
<http://cs.dbpedia.org/resource/Floyd\u016Fv\u2013Warshall\u016Fv_algoritmus>	<http://dbpedia.org/ontology/wikiPageWikiLink>	<http://cs.dbpedia.org/resource/Kategorie:Sm\u011Brovac\u00ED_algoritmy> .
<http://cs.dbpedia.org/resource/Floyd\u016Fv\u2013Warshall\u016Fv_algoritmus>	<http://dbpedia.org/ontology/wikiPageID>	"216353"^^<http://www.w3.org/2001/XMLSchema#integer> .
<http://cs.dbpedia.org/resource/Floyd\u016Fv\u2013Warshall\u016Fv_algoritmus>	<http://dbpedia.org/ontology/wikiPageWikiLink>	<http://cs.dbpedia.org/resource/Dynamick\u00E9_programov\u00E1n\u00ED> .
<http://cs.dbpedia.org/resource/Floyd\u016Fv\u2013Warshall\u016Fv_algoritmus>	<http://dbpedia.org/ontology/wikiPageWikiLink>	<http://cs.dbpedia.org/resource/Asymptotick\u00E1_slo\u017Eitost> .
<http://cs.dbpedia.org/resource/Floyd\u016Fv\u2013Warshall\u016Fv_algoritmus>	<http://dbpedia.org/ontology/wikiPageOutDegree>	"15"^^<http://www.w3.org/2001/XMLSchema#nonNegativeInteger> .
<http://cs.dbpedia.org/resource/Floyd\u016Fv\u2013Warshall\u016Fv_algoritmus>	<http://dbpedia.org/ontology/wikiPageWikiLink>	<http://cs.dbpedia.org/resource/Kategorie:Dynamick\u00E9_programov\u00E1n\u00ED> .
<http://cs.dbpedia.org/resource/Floyd\u016Fv\u2013Warshall\u016Fv_algoritmus>	<http://purl.org/dc/terms/subject>	<http://cs.dbpedia.org/resource/Kategorie:Dynamick\u00E9_programov\u00E1n\u00ED> .
<http://cs.dbpedia.org/resource/Floyd\u016Fv\u2013Warshall\u016Fv_algoritmus>	<http://dbpedia.org/ontology/wikiPageWikiLink>	<http://cs.dbpedia.org/resource/Bellman\u016Fv-Ford\u016Fv_algoritmus> .
<http://cs.dbpedia.org/resource/Floyd\u016Fv\u2013Warshall\u016Fv_algoritmus>	<http://dbpedia.org/ontology/wikiPageWikiLinkText>	"Floyd\u016Fv\u2013Warshall\u016Fv algoritmus"@cs .
<http://cs.dbpedia.org/resource/Floyd\u016Fv\u2013Warshall\u016Fv_algoritmus>	<http://dbpedia.org/ontology/wikiPageWikiLink>	<http://cs.dbpedia.org/resource/Graf_(teorie_graf\u016F)> .
<http://cs.dbpedia.org/resource/Floyd\u016Fv\u2013Warshall\u016Fv_algoritmus>	<http://cs.dbpedia.org/property/wikiPageUsesTemplate>	<http://cs.dbpedia.org/resource/\u0160ablona:Commonscat> .
<http://cs.dbpedia.org/resource/Floyd\u016Fv\u2013Warshall\u016Fv_algoritmus>	<http://dbpedia.org/ontology/wikiPageExternalLink>	<http://search.cpan.org/search?query=Graph&mode=all> .
<http://cs.dbpedia.org/resource/Floyd\u016Fv\u2013Warshall\u016Fv_algoritmus>	<http://cs.dbpedia.org/property/wikiPageUsesTemplate>	<http://cs.dbpedia.org/resource/\u0160ablona:Upravit_\u010D\u00E1st> .
<http://cs.dbpedia.org/resource/Floyd\u016Fv\u2013Warshall\u016Fv_algoritmus>	<http://dbpedia.org/ontology/wikiPageExternalLink>	<http://www.pms.informatik.uni-muenchen.de/lehre/compgeometry/Gosper/shortest_path/shortest_path.html#visualization> .
<http://cs.dbpedia.org/resource/Floyd\u016Fv\u2013Warshall\u016Fv_algoritmus>	<http://dbpedia.org/ontology/abstract>	"Floyd\u016Fv\u2013Warshall\u016Fv algoritmus (zn\u00E1m\u00FD tak\u00E9 jako Roy\u016Fv\u2013Floyd\u016Fv algoritmus) je po\u010D\u00EDta\u010Dov\u00FD algoritmus pou\u017E\u00EDvan\u00FD pro nalezen\u00ED nejkrat\u0161\u00EDch cest v orientovan\u00E9m grafu s hranami r\u016Fzn\u00FDch obecn\u00FDch (kladn\u00FDch) vah. Jedin\u00FD pr\u016Fchod algoritmu spo\u010Dte nejkrat\u0161\u00ED cestu mezi v\u0161emi dvojicemi vrchol\u016F. Floyd\u016Fv\u2013Warshall\u016Fv algoritmus je typick\u00FDm p\u0159\u00EDkladem dynamick\u00E9ho programov\u00E1n\u00ED. Algoritmus poprv\u00E9 popsali Robert Floyd a Stephen Warshall."@cs .
<http://cs.dbpedia.org/resource/Floyd\u016Fv\u2013Warshall\u016Fv_algoritmus>	<http://dbpedia.org/ontology/wikiPageWikiLink>	<http://cs.dbpedia.org/resource/Stephen_Warshall> .
<http://cs.dbpedia.org/resource/Floyd\u016Fv\u2013Warshall\u016Fv_algoritmus>	<http://www.w3.org/2000/01/rdf-schema#label>	"Floyd\u016Fv\u2013Warshall\u016Fv algoritmus"@cs .
<http://cs.dbpedia.org/resource/Floyd\u016Fv\u2013Warshall\u016Fv_algoritmus>	<http://cs.dbpedia.org/property/wikiPageUsesTemplate>	<http://cs.dbpedia.org/resource/\u0160ablona:P\u0159eklad> .
<http://cs.dbpedia.org/resource/Floyd\u016Fv\u2013Warshall\u016Fv_algoritmus>	<http://www.w3.org/2000/01/rdf-schema#comment>	"Floyd\u016Fv\u2013Warshall\u016Fv algoritmus (zn\u00E1m\u00FD tak\u00E9 jako Roy\u016Fv\u2013Floyd\u016Fv algoritmus) je po\u010D\u00EDta\u010Dov\u00FD algoritmus pou\u017E\u00EDvan\u00FD pro nalezen\u00ED nejkrat\u0161\u00EDch cest v orientovan\u00E9m grafu s hranami r\u016Fzn\u00FDch obecn\u00FDch (kladn\u00FDch) vah. Jedin\u00FD pr\u016Fchod algoritmu spo\u010Dte nejkrat\u0161\u00ED cestu mezi v\u0161emi dvojicemi vrchol\u016F. Floyd\u016Fv\u2013Warshall\u016Fv algoritmus je typick\u00FDm p\u0159\u00EDkladem dynamick\u00E9ho programov\u00E1n\u00ED. Algoritmus poprv\u00E9 popsali Robert Floyd a Stephen Warshall."@cs .
<http://cs.dbpedia.org/resource/Floyd\u016Fv\u2013Warshall\u016Fv_algoritmus>	<http://purl.org/dc/terms/subject>	<http://cs.dbpedia.org/resource/Kategorie:Sm\u011Brovac\u00ED_algoritmy> .
<http://cs.dbpedia.org/resource/Floyd\u016Fv\u2013Warshall\u016Fv_algoritmus>	<http://dbpedia.org/ontology/wikiPageWikiLink>	<http://cs.dbpedia.org/resource/Algoritmus> .
<http://cs.dbpedia.org/resource/Floyd\u016Fv\u2013Warshall\u016Fv_algoritmus>	<http://www.w3.org/ns/prov#wasDerivedFrom>	<http://cs.wikipedia.org/wiki/Floyd\u016Fv\u2013Warshall\u016Fv_algoritmus?oldid=15633056> .
<http://cs.dbpedia.org/resource/Floyd\u016Fv\u2013Warshall\u016Fv_algoritmus>	<http://dbpedia.org/ontology/wikiPageRevisionID>	"15633056"^^<http://www.w3.org/2001/XMLSchema#integer> .
<http://cs.dbpedia.org/resource/Floyd\u016Fv\u2013Warshall\u016Fv_algoritmus>	<http://xmlns.com/foaf/0.1/isPrimaryTopicOf>	<http://cs.wikipedia.org/wiki/Floyd\u016Fv\u2013Warshall\u016Fv_algoritmus> .
<http://cs.dbpedia.org/resource/Floyd\u016Fv\u2013Warshall\u016Fv_algoritmus>	<http://dbpedia.org/ontology/wikiPageWikiLink>	<http://cs.dbpedia.org/resource/Perl> .
<http://cs.dbpedia.org/resource/Floyd\u016Fv\u2013Warshall\u016Fv_algoritmus>	<http://dbpedia.org/ontology/wikiPageWikiLink>	<http://cs.dbpedia.org/resource/Python> .
<http://cs.dbpedia.org/resource/Floyd\u016Fv\u2013Warshall\u016Fv_algoritmus>	<http://dbpedia.org/ontology/wikiPageWikiLink>	<http://cs.dbpedia.org/resource/Kategorie:Grafov\u00E9_algoritmy> .
<http://cs.dbpedia.org/resource/Floyd\u016Fv\u2013Warshall\u016Fv_algoritmus>	<http://dbpedia.org/ontology/wikiPageWikiLink>	<http://cs.dbpedia.org/resource/Robert_Floyd> .
<http://cs.dbpedia.org/resource/Floyd\u016Fv\u2013Warshall\u016Fv_algoritmus>	<http://dbpedia.org/ontology/wikiPageLength>	"4296"^^<http://www.w3.org/2001/XMLSchema#nonNegativeInteger> .