<http://cs.dbpedia.org/resource/Constrained_Shortest_Path_First>	<http://cs.dbpedia.org/property/id>	"ISBN 978-3-8364-4633-4"@cs .
<http://cs.dbpedia.org/resource/Constrained_Shortest_Path_First>	<http://dbpedia.org/ontology/wikiPageWikiLink>	<http://cs.dbpedia.org/resource/IS-IS> .
<http://cs.dbpedia.org/resource/Constrained_Shortest_Path_First>	<http://dbpedia.org/ontology/wikiPageWikiLink>	<http://cs.dbpedia.org/resource/Kategorie:MPLS_s\u00EDt\u011B> .
<http://cs.dbpedia.org/resource/Constrained_Shortest_Path_First>	<http://dbpedia.org/ontology/wikiPageWikiLinkText>	"Constrained Shortest Path First"@cs .
<http://cs.dbpedia.org/resource/Constrained_Shortest_Path_First>	<http://dbpedia.org/ontology/wikiPageWikiLink>	<http://cs.dbpedia.org/resource/Kategorie:Internetov\u00E9_protokoly> .
<http://cs.dbpedia.org/resource/Constrained_Shortest_Path_First>	<http://cs.dbpedia.org/property/wikiPageUsesTemplate>	<http://cs.dbpedia.org/resource/\u0160ablona:Citace_monografie> .
<http://cs.dbpedia.org/resource/Constrained_Shortest_Path_First>	<http://dbpedia.org/ontology/thumbnail>	<http://commons.wikimedia.org/wiki/Special:FilePath/CSPF-Network.svg?width=300> .
<http://cs.dbpedia.org/resource/Constrained_Shortest_Path_First>	<http://purl.org/dc/terms/subject>	<http://cs.dbpedia.org/resource/Kategorie:MPLS_s\u00EDt\u011B> .
<http://cs.dbpedia.org/resource/Constrained_Shortest_Path_First>	<http://cs.dbpedia.org/property/url>	<http://d-nb.info/987067745> .
<http://cs.dbpedia.org/resource/Constrained_Shortest_Path_First>	<http://cs.dbpedia.org/property/vydavatel>	"VDM Verlag Dr. M\u00FCller"@cs .
<http://cs.dbpedia.org/resource/Constrained_Shortest_Path_First>	<http://dbpedia.org/ontology/wikiPageRevisionID>	"14761076"^^<http://www.w3.org/2001/XMLSchema#integer> .
<http://cs.dbpedia.org/resource/Constrained_Shortest_Path_First>	<http://dbpedia.org/ontology/wikiPageWikiLink>	<http://cs.dbpedia.org/resource/Multiprotocol_Label_Switching> .
<http://cs.dbpedia.org/resource/Constrained_Shortest_Path_First>	<http://cs.dbpedia.org/property/jm\u00E9no>	"Mark"@cs .
<http://cs.dbpedia.org/resource/Constrained_Shortest_Path_First>	<http://purl.org/dc/terms/subject>	<http://cs.dbpedia.org/resource/Kategorie:Internetov\u00E9_protokoly> .
<http://cs.dbpedia.org/resource/Constrained_Shortest_Path_First>	<http://dbpedia.org/ontology/wikiPageWikiLinkText>	"constrained shortest path first (CSPF)"@cs .
<http://cs.dbpedia.org/resource/Constrained_Shortest_Path_First>	<http://cs.dbpedia.org/property/rok>	"2007"^^<http://www.w3.org/2001/XMLSchema#integer> .
<http://cs.dbpedia.org/resource/Constrained_Shortest_Path_First>	<http://cs.dbpedia.org/property/p\u0159\u00EDjmen\u00ED>	"Ziegelmann"@cs .
<http://cs.dbpedia.org/resource/Constrained_Shortest_Path_First>	<http://dbpedia.org/ontology/wikiPageExternalLink>	<http://d-nb.info/987067745> .
<http://cs.dbpedia.org/resource/Constrained_Shortest_Path_First>	<http://dbpedia.org/ontology/wikiPageWikiLink>	<http://cs.dbpedia.org/resource/OSPF> .
<http://cs.dbpedia.org/resource/Constrained_Shortest_Path_First>	<http://www.w3.org/ns/prov#wasDerivedFrom>	<http://cs.wikipedia.org/wiki/Constrained_Shortest_Path_First?oldid=14761076> .
<http://cs.dbpedia.org/resource/Constrained_Shortest_Path_First>	<http://www.w3.org/2000/01/rdf-schema#label>	"Constrained Shortest Path First"@cs .
<http://cs.dbpedia.org/resource/Constrained_Shortest_Path_First>	<http://cs.dbpedia.org/property/titul>	"Constrained Shortest Path and Related Problems. Constrained Network Optimization"@cs .
<http://cs.dbpedia.org/resource/Constrained_Shortest_Path_First>	<http://dbpedia.org/ontology/wikiPageLength>	"2069"^^<http://www.w3.org/2001/XMLSchema#nonNegativeInteger> .
<http://cs.dbpedia.org/resource/Constrained_Shortest_Path_First>	<http://xmlns.com/foaf/0.1/depiction>	<http://commons.wikimedia.org/wiki/Special:FilePath/CSPF-Network.svg> .
<http://cs.dbpedia.org/resource/Constrained_Shortest_Path_First>	<http://purl.org/dc/terms/subject>	<http://cs.dbpedia.org/resource/Kategorie:Sm\u011Brovac\u00ED_protokoly> .
<http://cs.dbpedia.org/resource/Constrained_Shortest_Path_First>	<http://dbpedia.org/ontology/wikiPageWikiLink>	<http://cs.dbpedia.org/resource/Kategorie:Sm\u011Brovac\u00ED_protokoly> .
<http://cs.dbpedia.org/resource/Constrained_Shortest_Path_First>	<http://dbpedia.org/ontology/wikiPageID>	"1025462"^^<http://www.w3.org/2001/XMLSchema#integer> .
<http://cs.dbpedia.org/resource/Constrained_Shortest_Path_First>	<http://www.w3.org/2000/01/rdf-schema#comment>	"Constrained Shortest Path First (CSPF) je roz\u0161\u00ED\u0159en\u00ED algoritm\u016F pro hled\u00E1n\u00ED nejkrat\u0161\u00ED cesty. Cesta vypo\u010D\u00EDtan\u00E1 pomoc\u00ED CSPF je nejkrat\u0161\u00ED cesta spl\u0148uj\u00EDc\u00ED ur\u010Dit\u00E1 omezen\u00ED. Jednodu\u0161e to znamen\u00E1, \u017Ee algoritmus hled\u00E1n\u00ED nejkrat\u0161\u00ED cesty po vypu\u0161t\u011Bn\u00ED spoj\u016F, kter\u00E9 nespl\u0148uj\u00ED ur\u010Ditou sadu omezen\u00ED. Omezen\u00EDm m\u016F\u017Ee b\u00FDt nap\u0159. minim\u00E1ln\u00ED po\u017Eadovan\u00E1 \u0161\u00ED\u0159ka p\u00E1sma spoje (zaru\u010Den\u00E1 \u0161\u00ED\u0159ka p\u00E1sma), koncov\u00E9 zpo\u017Ed\u011Bn\u00ED, maxim\u00E1ln\u00ED po\u010Det pou\u017Eit\u00FDch hop\u016F, zahrnut\u00ED nebo vypu\u0161t\u011Bn\u00ED ur\u010Dit\u00FDch uzl\u016F."@cs .
<http://cs.dbpedia.org/resource/Constrained_Shortest_Path_First>	<http://dbpedia.org/ontology/abstract>	"Constrained Shortest Path First (CSPF) je roz\u0161\u00ED\u0159en\u00ED algoritm\u016F pro hled\u00E1n\u00ED nejkrat\u0161\u00ED cesty. Cesta vypo\u010D\u00EDtan\u00E1 pomoc\u00ED CSPF je nejkrat\u0161\u00ED cesta spl\u0148uj\u00EDc\u00ED ur\u010Dit\u00E1 omezen\u00ED. Jednodu\u0161e to znamen\u00E1, \u017Ee algoritmus hled\u00E1n\u00ED nejkrat\u0161\u00ED cesty po vypu\u0161t\u011Bn\u00ED spoj\u016F, kter\u00E9 nespl\u0148uj\u00ED ur\u010Ditou sadu omezen\u00ED. Omezen\u00EDm m\u016F\u017Ee b\u00FDt nap\u0159. minim\u00E1ln\u00ED po\u017Eadovan\u00E1 \u0161\u00ED\u0159ka p\u00E1sma spoje (zaru\u010Den\u00E1 \u0161\u00ED\u0159ka p\u00E1sma), koncov\u00E9 zpo\u017Ed\u011Bn\u00ED, maxim\u00E1ln\u00ED po\u010Det pou\u017Eit\u00FDch hop\u016F, zahrnut\u00ED nebo vypu\u0161t\u011Bn\u00ED ur\u010Dit\u00FDch uzl\u016F. CSPF se pou\u017E\u00EDv\u00E1 v MPLS Traffic Engineering. Sm\u011Brov\u00E1n\u00ED pomoc\u00ED CSPF se naz\u00FDv\u00E1 Constraint Based Routing (CBR).Cesta vypo\u010D\u00EDtan\u00E1 pomoc\u00ED CSPF m\u016F\u017Ee b\u00FDt stejn\u00E1 jako cesta vypo\u010D\u00EDtan\u00E1 pomoc\u00ED OSPF a IS-IS, ale m\u016F\u017Ee b\u00FDt i jin\u00E1 podle mno\u017Einy omezen\u00ED, kter\u00E1 maj\u00ED b\u00FDt spln\u011Bna."@cs .
<http://cs.dbpedia.org/resource/Constrained_Shortest_Path_First>	<http://dbpedia.org/ontology/wikiPageWikiLink>	<http://cs.dbpedia.org/resource/Teletraffic_technika> .
<http://cs.dbpedia.org/resource/Constrained_Shortest_Path_First>	<http://xmlns.com/foaf/0.1/isPrimaryTopicOf>	<http://cs.wikipedia.org/wiki/Constrained_Shortest_Path_First> .
<http://cs.dbpedia.org/resource/Constrained_Shortest_Path_First>	<http://dbpedia.org/ontology/wikiPageOutDegree>	"10"^^<http://www.w3.org/2001/XMLSchema#nonNegativeInteger> .
<http://cs.dbpedia.org/resource/Constrained_Shortest_Path_First>	<http://dbpedia.org/ontology/wikiPageWikiLink>	<http://cs.dbpedia.org/resource/Soubor:CSPF-Network.svg> .