<http://cs.dbpedia.org/resource/Ford\u016Fv\u2013Fulkerson\u016Fv_zna\u010Dkovac\u00ED_algoritmus>	<http://dbpedia.org/ontology/wikiPageLength>	"1873"^^<http://www.w3.org/2001/XMLSchema#nonNegativeInteger> .
<http://cs.dbpedia.org/resource/Ford\u016Fv\u2013Fulkerson\u016Fv_zna\u010Dkovac\u00ED_algoritmus>	<http://dbpedia.org/ontology/wikiPageWikiLink>	<http://cs.dbpedia.org/resource/Cesta_(graf)> .
<http://cs.dbpedia.org/resource/Ford\u016Fv\u2013Fulkerson\u016Fv_zna\u010Dkovac\u00ED_algoritmus>	<http://dbpedia.org/ontology/wikiPageWikiLink>	<http://cs.dbpedia.org/resource/Kategorie:Grafov\u00E9_algoritmy> .
<http://cs.dbpedia.org/resource/Ford\u016Fv\u2013Fulkerson\u016Fv_zna\u010Dkovac\u00ED_algoritmus>	<http://www.w3.org/2000/01/rdf-schema#comment>	"Ford\u016Fv-Fulkerson\u016Fv zna\u010Dkovac\u00ED algoritmus je obecn\u00FD postup zna\u010Dkov\u00E1n\u00ED nenasycen\u00E9 cesty v grafu p\u0159i v\u00FDpo\u010Dtu maxim\u00E1ln\u00EDho toku."@cs .
<http://cs.dbpedia.org/resource/Ford\u016Fv\u2013Fulkerson\u016Fv_zna\u010Dkovac\u00ED_algoritmus>	<http://dbpedia.org/ontology/wikiPageRevisionID>	"15632962"^^<http://www.w3.org/2001/XMLSchema#integer> .
<http://cs.dbpedia.org/resource/Ford\u016Fv\u2013Fulkerson\u016Fv_zna\u010Dkovac\u00ED_algoritmus>	<http://www.w3.org/2000/01/rdf-schema#label>	"Ford\u016Fv\u2013Fulkerson\u016Fv zna\u010Dkovac\u00ED algoritmus"@cs .
<http://cs.dbpedia.org/resource/Ford\u016Fv\u2013Fulkerson\u016Fv_zna\u010Dkovac\u00ED_algoritmus>	<http://dbpedia.org/ontology/wikiPageWikiLink>	<http://cs.dbpedia.org/resource/Graf_(teorie_graf\u016F)> .
<http://cs.dbpedia.org/resource/Ford\u016Fv\u2013Fulkerson\u016Fv_zna\u010Dkovac\u00ED_algoritmus>	<http://purl.org/dc/terms/subject>	<http://cs.dbpedia.org/resource/Kategorie:Grafov\u00E9_algoritmy> .
<http://cs.dbpedia.org/resource/Ford\u016Fv\u2013Fulkerson\u016Fv_zna\u010Dkovac\u00ED_algoritmus>	<http://dbpedia.org/ontology/wikiPageID>	"516995"^^<http://www.w3.org/2001/XMLSchema#integer> .
<http://cs.dbpedia.org/resource/Ford\u016Fv\u2013Fulkerson\u016Fv_zna\u010Dkovac\u00ED_algoritmus>	<http://dbpedia.org/ontology/abstract>	"Ford\u016Fv-Fulkerson\u016Fv zna\u010Dkovac\u00ED algoritmus je obecn\u00FD postup zna\u010Dkov\u00E1n\u00ED nenasycen\u00E9 cesty v grafu p\u0159i v\u00FDpo\u010Dtu maxim\u00E1ln\u00EDho toku."@cs .
<http://cs.dbpedia.org/resource/Ford\u016Fv\u2013Fulkerson\u016Fv_zna\u010Dkovac\u00ED_algoritmus>	<http://www.w3.org/ns/prov#wasDerivedFrom>	<http://cs.wikipedia.org/wiki/Ford\u016Fv\u2013Fulkerson\u016Fv_zna\u010Dkovac\u00ED_algoritmus?oldid=15632962> .
<http://cs.dbpedia.org/resource/Ford\u016Fv\u2013Fulkerson\u016Fv_zna\u010Dkovac\u00ED_algoritmus>	<http://dbpedia.org/ontology/wikiPageWikiLinkText>	"Ford\u016Fv\u2013Fulkerson\u016Fv zna\u010Dkovac\u00ED algoritmus"@cs .
<http://cs.dbpedia.org/resource/Ford\u016Fv\u2013Fulkerson\u016Fv_zna\u010Dkovac\u00ED_algoritmus>	<http://dbpedia.org/ontology/wikiPageWikiLink>	<http://cs.dbpedia.org/resource/Maxim\u00E1ln\u00ED_tok_grafem> .
<http://cs.dbpedia.org/resource/Ford\u016Fv\u2013Fulkerson\u016Fv_zna\u010Dkovac\u00ED_algoritmus>	<http://dbpedia.org/ontology/wikiPageOutDegree>	"7"^^<http://www.w3.org/2001/XMLSchema#nonNegativeInteger> .
<http://cs.dbpedia.org/resource/Ford\u016Fv\u2013Fulkerson\u016Fv_zna\u010Dkovac\u00ED_algoritmus>	<http://dbpedia.org/ontology/wikiPageWikiLink>	<http://cs.dbpedia.org/resource/Vstupn\u00ED_uzel> .
<http://cs.dbpedia.org/resource/Ford\u016Fv\u2013Fulkerson\u016Fv_zna\u010Dkovac\u00ED_algoritmus>	<http://dbpedia.org/ontology/wikiPageWikiLink>	<http://cs.dbpedia.org/resource/S\u00ED\u0165_(teorie_graf\u016F)> .
<http://cs.dbpedia.org/resource/Ford\u016Fv\u2013Fulkerson\u016Fv_zna\u010Dkovac\u00ED_algoritmus>	<http://xmlns.com/foaf/0.1/isPrimaryTopicOf>	<http://cs.wikipedia.org/wiki/Ford\u016Fv\u2013Fulkerson\u016Fv_zna\u010Dkovac\u00ED_algoritmus> .
<http://cs.dbpedia.org/resource/Ford\u016Fv\u2013Fulkerson\u016Fv_zna\u010Dkovac\u00ED_algoritmus>	<http://dbpedia.org/ontology/wikiPageWikiLink>	<http://cs.dbpedia.org/resource/Hrana_(graf)> .