{
  "http://en.wikipedia.org/wiki/Dijkstra's_algorithm" : { "http://xmlns.com/foaf/0.1/primaryTopic" : [ { "type" : "uri", "value" : "http://dbpedia.org/resource/Dijkstra's_algorithm" } ] } ,
  "http://dbpedia.org/resource/IS-IS" : { "http://dbpedia.org/ontology/wikiPageWikiLink" : [ { "type" : "uri", "value" : "http://dbpedia.org/resource/Dijkstra's_algorithm" } ] } ,
  "http://dbpedia.org/resource/Shortest_Path_First" : { "http://dbpedia.org/ontology/wikiPageWikiLink" : [ { "type" : "uri", "value" : "http://dbpedia.org/resource/Dijkstra's_algorithm" } ] ,
    "http://dbpedia.org/ontology/wikiPageRedirects" : [ { "type" : "uri", "value" : "http://dbpedia.org/resource/Dijkstra's_algorithm" } ] } ,
  "http://dbpedia.org/resource/Any-angle_path_planning" : { "http://dbpedia.org/ontology/wikiPageWikiLink" : [ { "type" : "uri", "value" : "http://dbpedia.org/resource/Dijkstra's_algorithm" } ] } ,
  "http://dbpedia.org/resource/Pathfinding" : { "http://dbpedia.org/ontology/wikiPageWikiLink" : [ { "type" : "uri", "value" : "http://dbpedia.org/resource/Dijkstra's_algorithm" } ] } ,
  "http://dbpedia.org/resource/Kruskal's_algorithm" : { "http://dbpedia.org/ontology/wikiPageWikiLink" : [ { "type" : "uri", "value" : "http://dbpedia.org/resource/Dijkstra's_algorithm" } ] } ,
  "http://dbpedia.org/resource/Heap_(data_structure)" : { "http://dbpedia.org/ontology/wikiPageWikiLink" : [ { "type" : "uri", "value" : "http://dbpedia.org/resource/Dijkstra's_algorithm" } ] } ,
  "http://dbpedia.org/resource/Micromouse" : { "http://dbpedia.org/ontology/wikiPageWikiLink" : [ { "type" : "uri", "value" : "http://dbpedia.org/resource/Dijkstra's_algorithm" } ] } ,
  "http://dbpedia.org/resource/Distance" : { "http://dbpedia.org/ontology/wikiPageWikiLink" : [ { "type" : "uri", "value" : "http://dbpedia.org/resource/Dijkstra's_algorithm" } ] } ,
  "http://dbpedia.org/resource/Directed_acyclic_graph" : { "http://dbpedia.org/ontology/wikiPageWikiLink" : [ { "type" : "uri", "value" : "http://dbpedia.org/resource/Dijkstra's_algorithm" } ] } ,
  "http://dbpedia.org/resource/Planar_separator_theorem" : { "http://dbpedia.org/ontology/wikiPageWikiLink" : [ { "type" : "uri", "value" : "http://dbpedia.org/resource/Dijkstra's_algorithm" } ] } ,
  "http://dbpedia.org/resource/Robert_C._Prim" : { "http://dbpedia.org/ontology/wikiPageWikiLink" : [ { "type" : "uri", "value" : "http://dbpedia.org/resource/Dijkstra's_algorithm" } ] } ,
  "http://dbpedia.org/resource/Scalable_Source_Routing" : { "http://dbpedia.org/ontology/wikiPageWikiLink" : [ { "type" : "uri", "value" : "http://dbpedia.org/resource/Dijkstra's_algorithm" } ] } ,
  "http://dbpedia.org/resource/Search_algorithm" : { "http://dbpedia.org/ontology/wikiPageWikiLink" : [ { "type" : "uri", "value" : "http://dbpedia.org/resource/Dijkstra's_algorithm" } ] } ,
  "http://dbpedia.org/resource/Biological_network_inference" : { "http://dbpedia.org/ontology/wikiPageWikiLink" : [ { "type" : "uri", "value" : "http://dbpedia.org/resource/Dijkstra's_algorithm" } ] } ,
  "http://dbpedia.org/resource/Motion_planning" : { "http://dbpedia.org/ontology/wikiPageWikiLink" : [ { "type" : "uri", "value" : "http://dbpedia.org/resource/Dijkstra's_algorithm" } ] } ,
  "http://dbpedia.org/resource/Open_Shortest_Path_First" : { "http://dbpedia.org/ontology/wikiPageWikiLink" : [ { "type" : "uri", "value" : "http://dbpedia.org/resource/Dijkstra's_algorithm" } ] } ,
  "http://dbpedia.org/resource/Dijkstra's_shortest_path" : { "http://dbpedia.org/ontology/wikiPageWikiLink" : [ { "type" : "uri", "value" : "http://dbpedia.org/resource/Dijkstra's_algorithm" } ] ,
    "http://dbpedia.org/ontology/wikiPageRedirects" : [ { "type" : "uri", "value" : "http://dbpedia.org/resource/Dijkstra's_algorithm" } ] } ,
  "http://dbpedia.org/resource/Edsger_W._Dijkstra" : { "http://dbpedia.org/ontology/wikiPageWikiLink" : [ { "type" : "uri", "value" : "http://dbpedia.org/resource/Dijkstra's_algorithm" } ] } ,
  "http://dbpedia.org/resource/List_of_computer_scientists" : { "http://dbpedia.org/ontology/wikiPageWikiLink" : [ { "type" : "uri", "value" : "http://dbpedia.org/resource/Dijkstra's_algorithm" } ] } ,
  "http://dbpedia.org/resource/List_of_programmers" : { "http://dbpedia.org/ontology/wikiPageWikiLink" : [ { "type" : "uri", "value" : "http://dbpedia.org/resource/Dijkstra's_algorithm" } ] } ,
  "http://dbpedia.org/resource/Private_Network-to-Network_Interface" : { "http://dbpedia.org/ontology/wikiPageWikiLink" : [ { "type" : "uri", "value" : "http://dbpedia.org/resource/Dijkstra's_algorithm" } ] } ,
  "http://dbpedia.org/resource/Spanning_tree" : { "http://dbpedia.org/ontology/wikiPageWikiLink" : [ { "type" : "uri", "value" : "http://dbpedia.org/resource/Dijkstra's_algorithm" } ] } ,
  "http://dbpedia.org/resource/Greedy_geometric_spanner" : { "http://dbpedia.org/ontology/wikiPageWikiLink" : [ { "type" : "uri", "value" : "http://dbpedia.org/resource/Dijkstra's_algorithm" } ] } ,
  "http://dbpedia.org/resource/Transport_network_analysis" : { "http://dbpedia.org/ontology/wikiPageWikiLink" : [ { "type" : "uri", "value" : "http://dbpedia.org/resource/Dijkstra's_algorithm" } ] } ,
  "http://dbpedia.org/resource/Euclidean_shortest_path" : { "http://dbpedia.org/ontology/wikiPageWikiLink" : [ { "type" : "uri", "value" : "http://dbpedia.org/resource/Dijkstra's_algorithm" } ] } ,
  "http://dbpedia.org/resource/Richard_E._Bellman" : { "http://dbpedia.org/ontology/wikiPageWikiLink" : [ { "type" : "uri", "value" : "http://dbpedia.org/resource/Dijkstra's_algorithm" } ] } ,
  "http://dbpedia.org/resource/List_of_terms_relating_to_algorithms_and_data_structures" : { "http://dbpedia.org/ontology/wikiPageWikiLink" : [ { "type" : "uri", "value" : "http://dbpedia.org/resource/Dijkstra's_algorithm" } ] } ,
  "http://dbpedia.org/resource/Contraction_hierarchies" : { "http://dbpedia.org/ontology/wikiPageWikiLink" : [ { "type" : "uri", "value" : "http://dbpedia.org/resource/Dijkstra's_algorithm" } ] } ,
  "http://dbpedia.org/resource/Shortest_path_problem" : { "http://dbpedia.org/ontology/wikiPageWikiLink" : [ { "type" : "uri", "value" : "http://dbpedia.org/resource/Dijkstra's_algorithm" } ] } ,
  "http://dbpedia.org/resource/Traffic_flow" : { "http://dbpedia.org/ontology/wikiPageWikiLink" : [ { "type" : "uri", "value" : "http://dbpedia.org/resource/Dijkstra's_algorithm" } ] } ,
  "http://dbpedia.org/resource/Greedy_algorithm" : { "http://dbpedia.org/ontology/wikiPageWikiLink" : [ { "type" : "uri", "value" : "http://dbpedia.org/resource/Dijkstra's_algorithm" } ] } ,
  "http://dbpedia.org/resource/Crowd_simulation" : { "http://dbpedia.org/ontology/wikiPageWikiLink" : [ { "type" : "uri", "value" : "http://dbpedia.org/resource/Dijkstra's_algorithm" } ] } ,
  "http://dbpedia.org/resource/Steiner_tree_problem" : { "http://dbpedia.org/ontology/wikiPageWikiLink" : [ { "type" : "uri", "value" : "http://dbpedia.org/resource/Dijkstra's_algorithm" } ] } ,
  "http://dbpedia.org/resource/Bitangent" : { "http://dbpedia.org/ontology/wikiPageWikiLink" : [ { "type" : "uri", "value" : "http://dbpedia.org/resource/Dijkstra's_algorithm" } ] } ,
  "http://dbpedia.org/resource/Shortest-path_tree" : { "http://dbpedia.org/ontology/wikiPageWikiLink" : [ { "type" : "uri", "value" : "http://dbpedia.org/resource/Dijkstra's_algorithm" } ] } ,
  "http://dbpedia.org/resource/Fast_marching_method" : { "http://dbpedia.org/ontology/wikiPageWikiLink" : [ { "type" : "uri", "value" : "http://dbpedia.org/resource/Dijkstra's_algorithm" } ] } ,
  "http://dbpedia.org/resource/Cycle_basis" : { "http://dbpedia.org/ontology/wikiPageWikiLink" : [ { "type" : "uri", "value" : "http://dbpedia.org/resource/Dijkstra's_algorithm" } ] } ,
  "http://dbpedia.org/resource/Path_(graph_theory)" : { "http://dbpedia.org/ontology/wikiPageWikiLink" : [ { "type" : "uri", "value" : "http://dbpedia.org/resource/Dijkstra's_algorithm" } ] } ,
  "http://dbpedia.org/resource/Fibonacci_heap" : { "http://dbpedia.org/ontology/wikiPageWikiLink" : [ { "type" : "uri", "value" : "http://dbpedia.org/resource/Dijkstra's_algorithm" } ] } ,
  "http://dbpedia.org/resource/AF-heap" : { "http://dbpedia.org/ontology/wikiPageWikiLink" : [ { "type" : "uri", "value" : "http://dbpedia.org/resource/Dijkstra's_algorithm" } ] } ,
  "http://dbpedia.org/resource/List_of_algorithms" : { "http://dbpedia.org/ontology/wikiPageWikiLink" : [ { "type" : "uri", "value" : "http://dbpedia.org/resource/Dijkstra's_algorithm" } ] } ,
  "http://dbpedia.org/resource/Timeline_of_algorithms" : { "http://dbpedia.org/ontology/wikiPageWikiLink" : [ { "type" : "uri", "value" : "http://dbpedia.org/resource/Dijkstra's_algorithm" } ] } ,
  "http://dbpedia.org/resource/Numbers_(season_3)" : { "http://dbpedia.org/ontology/wikiPageWikiLink" : [ { "type" : "uri", "value" : "http://dbpedia.org/resource/Dijkstra's_algorithm" } ] } ,
  "http://dbpedia.org/resource/Multidimensional_network" : { "http://dbpedia.org/ontology/wikiPageWikiLink" : [ { "type" : "uri", "value" : "http://dbpedia.org/resource/Dijkstra's_algorithm" } ] } ,
  "http://dbpedia.org/resource/Link_analysis" : { "http://dbpedia.org/ontology/wikiPageWikiLink" : [ { "type" : "uri", "value" : "http://dbpedia.org/resource/Dijkstra's_algorithm" } ] } ,
  "http://dbpedia.org/resource/Incidence_and_Symmetry_in_Design_and_Architecture" : { "http://dbpedia.org/ontology/wikiPageWikiLink" : [ { "type" : "uri", "value" : "http://dbpedia.org/resource/Dijkstra's_algorithm" } ] } ,
  "http://dbpedia.org/resource/Monotone_priority_queue" : { "http://dbpedia.org/ontology/wikiPageWikiLink" : [ { "type" : "uri", "value" : "http://dbpedia.org/resource/Dijkstra's_algorithm" } ] } ,
  "http://dbpedia.org/resource/Parallel_single-source_shortest_path_algorithm" : { "http://dbpedia.org/ontology/wikiPageWikiLink" : [ { "type" : "uri", "value" : "http://dbpedia.org/resource/Dijkstra's_algorithm" } ] } ,
  "http://dbpedia.org/resource/Shortest_Path_Faster_Algorithm" : { "http://dbpedia.org/ontology/wikiPageWikiLink" : [ { "type" : "uri", "value" : "http://dbpedia.org/resource/Dijkstra's_algorithm" } ] } ,
  "http://dbpedia.org/resource/List_of_Dutch_inventions_and_innovations" : { "http://dbpedia.org/ontology/wikiPageWikiLink" : [ { "type" : "uri", "value" : "http://dbpedia.org/resource/Dijkstra's_algorithm" } ] } ,
  "http://dbpedia.org/resource/Modular_Mining_Systems" : { "http://dbpedia.org/ontology/wikiPageWikiLink" : [ { "type" : "uri", "value" : "http://dbpedia.org/resource/Dijkstra's_algorithm" } ] } ,
  "http://dbpedia.org/resource/Journey_planner" : { "http://dbpedia.org/ontology/wikiPageWikiLink" : [ { "type" : "uri", "value" : "http://dbpedia.org/resource/Dijkstra's_algorithm" } ] } ,
  "http://dbpedia.org/resource/Uniform_Cost_Search" : { "http://dbpedia.org/ontology/wikiPageWikiLink" : [ { "type" : "uri", "value" : "http://dbpedia.org/resource/Dijkstra's_algorithm" } ] ,
    "http://dbpedia.org/ontology/wikiPageRedirects" : [ { "type" : "uri", "value" : "http://dbpedia.org/resource/Dijkstra's_algorithm" } ] } ,
  "http://dbpedia.org/resource/Farthest-first_traversal" : { "http://dbpedia.org/ontology/wikiPageWikiLink" : [ { "type" : "uri", "value" : "http://dbpedia.org/resource/Dijkstra's_algorithm" } ] } ,
  "http://dbpedia.org/resource/Branch_and_bound" : { "http://dbpedia.org/ontology/wikiPageWikiLink" : [ { "type" : "uri", "value" : "http://dbpedia.org/resource/Dijkstra's_algorithm" } ] } ,
  "http://dbpedia.org/resource/Dijkstra's_algorithm" : { "http://www.w3.org/1999/02/22-rdf-syntax-ns#type" : [ { "type" : "uri", "value" : "http://www.w3.org/2002/07/owl#Thing" } ,
      { "type" : "uri", "value" : "http://dbpedia.org/ontology/Algorithm" } ] ,
    "http://www.w3.org/2002/07/owl#differentFrom" : [ { "type" : "uri", "value" : "http://dbpedia.org/resource/Dykstra's_projection_algorithm" } ] ,
    "http://www.w3.org/2002/07/owl#sameAs" : [ { "type" : "uri", "value" : "http://hy.dbpedia.org/resource/\u0534\u0565\u0584\u057D\u057F\u0580\u0561\u0575\u056B_\u0561\u056C\u0563\u0578\u0580\u056B\u0569\u0574" } ,
      { "type" : "uri", "value" : "http://yago-knowledge.org/resource/Dijkstra's_algorithm" } ,
      { "type" : "uri", "value" : "http://fa.dbpedia.org/resource/\u0627\u0644\u06AF\u0648\u0631\u06CC\u062A\u0645_\u062F\u0627\u06CC\u06A9\u0633\u062A\u0631\u0627" } ,
      { "type" : "uri", "value" : "http://sl.dbpedia.org/resource/Dijkstrov_algoritem" } ,
      { "type" : "uri", "value" : "http://nl.dbpedia.org/resource/Kortstepad-algoritme" } ,
      { "type" : "uri", "value" : "http://ko.dbpedia.org/resource/\uB370\uC774\uD06C\uC2A4\uD2B8\uB77C_\uC54C\uACE0\uB9AC\uC998" } ,
      { "type" : "uri", "value" : "http://hr.dbpedia.org/resource/Dijkstrin_algoritam" } ,
      { "type" : "uri", "value" : "http://lt.dbpedia.org/resource/Dijkstros_algoritmas" } ,
      { "type" : "uri", "value" : "http://sv.dbpedia.org/resource/Dijkstras_algoritm" } ,
      { "type" : "uri", "value" : "http://es.dbpedia.org/resource/Algoritmo_de_Dijkstra" } ,
      { "type" : "uri", "value" : "http://da.dbpedia.org/resource/Dijkstras_algoritme" } ,
      { "type" : "uri", "value" : "http://de.dbpedia.org/resource/Dijkstra-Algorithmus" } ,
      { "type" : "uri", "value" : "http://lv.dbpedia.org/resource/Deikstras_algoritms" } ,
      { "type" : "uri", "value" : "http://commons.dbpedia.org/resource/Dijkstra's_algorithm" } ,
      { "type" : "uri", "value" : "http://fi.dbpedia.org/resource/Dijkstran_algoritmi" } ,
      { "type" : "uri", "value" : "http://zh.dbpedia.org/resource/\u6234\u514B\u65AF\u7279\u62C9\u7B97\u6CD5" } ,
      { "type" : "uri", "value" : "https://global.dbpedia.org/id/4zzsS" } ,
      { "type" : "uri", "value" : "http://www.wikidata.org/entity/Q8548" } ,
      { "type" : "uri", "value" : "http://et.dbpedia.org/resource/Dijkstra_algoritm" } ,
      { "type" : "uri", "value" : "http://pt.dbpedia.org/resource/Algoritmo_de_Dijkstra" } ,
      { "type" : "uri", "value" : "http://bg.dbpedia.org/resource/\u0410\u043B\u0433\u043E\u0440\u0438\u0442\u044A\u043C_\u043D\u0430_\u0414\u0435\u0439\u043A\u0441\u0442\u0440\u0430" } ,
      { "type" : "uri", "value" : "http://bs.dbpedia.org/resource/Dijkstrin_algoritam" } ,
      { "type" : "uri", "value" : "http://sh.dbpedia.org/resource/Dijkstrin_algoritam" } ,
      { "type" : "uri", "value" : "http://no.dbpedia.org/resource/Dijkstras_algoritme" } ,
      { "type" : "uri", "value" : "http://ja.dbpedia.org/resource/\u30C0\u30A4\u30AF\u30B9\u30C8\u30E9\u6CD5" } ,
      { "type" : "uri", "value" : "http://mn.dbpedia.org/resource/\u0414\u0438\u0436\u0438\u043A\u0441\u0442\u0440\u0430\u0433\u0438\u0439\u043D_\u0430\u043B\u0433\u043E\u0440\u0438\u0442\u043C" } ,
      { "type" : "uri", "value" : "http://it.dbpedia.org/resource/Algoritmo_di_Dijkstra" } ,
      { "type" : "uri", "value" : "http://pl.dbpedia.org/resource/Algorytm_Dijkstry" } ,
      { "type" : "uri", "value" : "http://el.dbpedia.org/resource/\u0391\u03BB\u03B3\u03CC\u03C1\u03B9\u03B8\u03BC\u03BF\u03C2_\u03C4\u03BF\u03C5_\u039D\u03C4\u03AC\u03B9\u03BA\u03C3\u03C4\u03C1\u03B1" } ,
      { "type" : "uri", "value" : "http://cy.dbpedia.org/resource/Algorithm_Dijkstra" } ,
      { "type" : "uri", "value" : "http://vi.dbpedia.org/resource/Thu\u1EADt_to\u00E1n_Dijkstra" } ,
      { "type" : "uri", "value" : "http://rdf.freebase.com/ns/m.0cf7t" } ,
      { "type" : "uri", "value" : "http://sr.dbpedia.org/resource/\u0414\u0430\u0458\u043A\u0441\u0442\u0440\u0438\u043D_\u0430\u043B\u0433\u043E\u0440\u0438\u0442\u0430\u043C" } ,
      { "type" : "uri", "value" : "http://uk.dbpedia.org/resource/\u0410\u043B\u0433\u043E\u0440\u0438\u0442\u043C_\u0414\u0435\u0439\u043A\u0441\u0442\u0440\u0438" } ,
      { "type" : "uri", "value" : "http://ca.dbpedia.org/resource/Algorisme_de_Dijkstra" } ,
      { "type" : "uri", "value" : "http://fr.dbpedia.org/resource/Algorithme_de_Dijkstra" } ,
      { "type" : "uri", "value" : "http://sk.dbpedia.org/resource/Dijkstrov_algoritmus" } ,
      { "type" : "uri", "value" : "http://ar.dbpedia.org/resource/\u062E\u0648\u0627\u0631\u0632\u0645\u064A\u0629_\u062F\u064A\u0643\u0633\u062A\u0631\u0627" } ,
      { "type" : "uri", "value" : "http://he.dbpedia.org/resource/\u05D0\u05DC\u05D2\u05D5\u05E8\u05D9\u05EA\u05DD_\u05D3\u05D9\u05D9\u05E7\u05E1\u05D8\u05E8\u05D4" } ,
      { "type" : "uri", "value" : "http://simple.dbpedia.org/resource/Dijkstra's_algorithm" } ,
      { "type" : "uri", "value" : "http://th.dbpedia.org/resource/\u0E02\u0E31\u0E49\u0E19\u0E15\u0E2D\u0E19\u0E27\u0E34\u0E18\u0E35\u0E02\u0E2D\u0E07\u0E44\u0E14\u0E01\u0E4C\u0E2A\u0E15\u0E23\u0E32" } ,
      { "type" : "uri", "value" : "http://ru.dbpedia.org/resource/\u0410\u043B\u0433\u043E\u0440\u0438\u0442\u043C_\u0414\u0435\u0439\u043A\u0441\u0442\u0440\u044B" } ,
      { "type" : "uri", "value" : "http://mk.dbpedia.org/resource/\u0414\u0430\u0458\u043A\u0441\u0442\u0440\u0438\u043D_\u0430\u043B\u043E\u0433\u0438\u0440\u0442\u0430\u043C" } ,
      { "type" : "uri", "value" : "http://cs.dbpedia.org/resource/Dijkstr\u016Fv_algoritmus" } ,
      { "type" : "uri", "value" : "http://hi.dbpedia.org/resource/\u0921\u093F\u091C\u0915\u094D\u0938\u094D\u091F\u094D\u0930\u093E_\u0915\u093E_\u0905\u0932\u094D\u0917\u094B\u0930\u093F\u0926\u094D\u092E" } ,
      { "type" : "uri", "value" : "http://id.dbpedia.org/resource/Algoritma_Dijkstra" } ,
      { "type" : "uri", "value" : "http://eu.dbpedia.org/resource/Dijkstraren_algoritmo" } ,
      { "type" : "uri", "value" : "http://hu.dbpedia.org/resource/Dijkstra-algoritmus" } ,
      { "type" : "uri", "value" : "http://ro.dbpedia.org/resource/Algoritmul_lui_Dijkstra" } ,
      { "type" : "uri", "value" : "http://dbpedia.org/resource/Dijkstra's_algorithm" } ,
      { "type" : "uri", "value" : "http://lmo.dbpedia.org/resource/Algoritm_de_Dijkstra" } ] ,
    "http://www.w3.org/2000/01/rdf-schema#label" : [ { "type" : "literal", "value" : "\u062E\u0648\u0627\u0631\u0632\u0645\u064A\u0629 \u062F\u064A\u0643\u0633\u062A\u0631\u0627" , "lang" : "ar" } ,
      { "type" : "literal", "value" : "\u0410\u043B\u0433\u043E\u0440\u0438\u0442\u043C \u0414\u0435\u0439\u043A\u0441\u0442\u0440\u0438" , "lang" : "uk" } ,
      { "type" : "literal", "value" : "Algoritmo di Dijkstra" , "lang" : "it" } ,
      { "type" : "literal", "value" : "Algorithme de Dijkstra" , "lang" : "fr" } ,
      { "type" : "literal", "value" : "\u30C0\u30A4\u30AF\u30B9\u30C8\u30E9\u6CD5" , "lang" : "ja" } ,
      { "type" : "literal", "value" : "\u6234\u514B\u65AF\u7279\u62C9\u7B97\u6CD5" , "lang" : "zh" } ,
      { "type" : "literal", "value" : "Algoritmo de Dijkstra" , "lang" : "es" } ,
      { "type" : "literal", "value" : "\u0410\u043B\u0433\u043E\u0440\u0438\u0442\u043C \u0414\u0435\u0439\u043A\u0441\u0442\u0440\u044B" , "lang" : "ru" } ,
      { "type" : "literal", "value" : "Dijkstraren algoritmo" , "lang" : "eu" } ,
      { "type" : "literal", "value" : "Kortstepad-algoritme" , "lang" : "nl" } ,
      { "type" : "literal", "value" : "Dijkstr\u016Fv algoritmus" , "lang" : "cs" } ,
      { "type" : "literal", "value" : "Dijkstra's algorithm" , "lang" : "en" } ,
      { "type" : "literal", "value" : "\uB370\uC774\uD06C\uC2A4\uD2B8\uB77C \uC54C\uACE0\uB9AC\uC998" , "lang" : "ko" } ,
      { "type" : "literal", "value" : "Dijkstras algoritm" , "lang" : "sv" } ,
      { "type" : "literal", "value" : "Algoritma Dijkstra" , "lang" : "in" } ,
      { "type" : "literal", "value" : "\u0391\u03BB\u03B3\u03CC\u03C1\u03B9\u03B8\u03BC\u03BF\u03C2 \u03C4\u03BF\u03C5 \u039D\u03C4\u03AC\u03B9\u03BA\u03C3\u03C4\u03C1\u03B1" , "lang" : "el" } ,
      { "type" : "literal", "value" : "Algorisme de Dijkstra" , "lang" : "ca" } ,
      { "type" : "literal", "value" : "Dijkstra-Algorithmus" , "lang" : "de" } ,
      { "type" : "literal", "value" : "Algoritmo de Dijkstra" , "lang" : "pt" } ,
      { "type" : "literal", "value" : "Algorytm Dijkstry" , "lang" : "pl" } ] ,
    "http://xmlns.com/foaf/0.1/depiction" : [ { "type" : "uri", "value" : "http://commons.wikimedia.org/wiki/Special:FilePath/DijkstraDemo.gif" } ,
      { "type" : "uri", "value" : "http://commons.wikimedia.org/wiki/Special:FilePath/Dijkstra_Animation.gif" } ,
      { "type" : "uri", "value" : "http://commons.wikimedia.org/wiki/Special:FilePath/Dijkstras_progress_animation.gif" } ] ,
    "http://www.w3.org/ns/prov#wasDerivedFrom" : [ { "type" : "uri", "value" : "http://en.wikipedia.org/wiki/Dijkstra's_algorithm?oldid=1306611316&ns=0" } ] ,
    "http://xmlns.com/foaf/0.1/isPrimaryTopicOf" : [ { "type" : "uri", "value" : "http://en.wikipedia.org/wiki/Dijkstra's_algorithm" } ] ,
    "http://dbpedia.org/ontology/wikiPageWikiLink" : [ { "type" : "uri", "value" : "http://dbpedia.org/resource/Graph_(abstract_data_type)" } ,
      { "type" : "uri", "value" : "http://dbpedia.org/resource/Theoretical_computer_science" } ,
      { "type" : "uri", "value" : "http://dbpedia.org/resource/Adjacency_matrix" } ,
      { "type" : "uri", "value" : "http://dbpedia.org/resource/Centrum_Wiskunde_&_Informatica" } ,
      { "type" : "uri", "value" : "http://dbpedia.org/resource/Bidirectional_search" } ,
      { "type" : "uri", "value" : "http://dbpedia.org/resource/Graph_(data_structure)" } ,
      { "type" : "uri", "value" : "http://dbpedia.org/resource/Category:1959_in_computing" } ,
      { "type" : "uri", "value" : "http://dbpedia.org/resource/Pseudocode" } ,
      { "type" : "uri", "value" : "http://dbpedia.org/resource/Greedy_algorithm" } ,
      { "type" : "uri", "value" : "http://dbpedia.org/resource/Category:Articles_with_example_pseudocode" } ,
      { "type" : "uri", "value" : "http://dbpedia.org/resource/Van_Emde_Boas_tree" } ,
      { "type" : "uri", "value" : "http://dbpedia.org/resource/Probability_distribution" } ,
      { "type" : "uri", "value" : "http://dbpedia.org/resource/Subroutine" } ,
      { "type" : "uri", "value" : "http://dbpedia.org/resource/Category:Combinatorial_optimization" } ,
      { "type" : "uri", "value" : "http://dbpedia.org/resource/Minimum_spanning_tree" } ,
      { "type" : "uri", "value" : "http://dbpedia.org/resource/Breadth-first_search" } ,
      { "type" : "uri", "value" : "http://dbpedia.org/resource/Rotterdam" } ,
      { "type" : "uri", "value" : "http://dbpedia.org/resource/Set_(abstract_data_type)" } ,
      { "type" : "uri", "value" : "http://dbpedia.org/resource/File:DijkstraDemo.gif" } ,
      { "type" : "uri", "value" : "http://dbpedia.org/resource/File:Dijkstras_progress_animation.gif" } ,
      { "type" : "uri", "value" : "http://dbpedia.org/resource/Least-cost_path" } ,
      { "type" : "uri", "value" : "http://dbpedia.org/resource/Transit_Node_Routing" } ,
      { "type" : "uri", "value" : "http://dbpedia.org/resource/Category:Dutch_inventions" } ,
      { "type" : "uri", "value" : "http://dbpedia.org/resource/Consistent_heuristic" } ,
      { "type" : "uri", "value" : "http://dbpedia.org/resource/Category:Graph_distance" } ,
      { "type" : "uri", "value" : "http://dbpedia.org/resource/Link-state_routing_protocol" } ,
      { "type" : "uri", "value" : "http://dbpedia.org/resource/Floyd\u2013Warshall_algorithm" } ,
      { "type" : "uri", "value" : "http://dbpedia.org/resource/Bucket_queue" } ,
      { "type" : "uri", "value" : "http://dbpedia.org/resource/Robert_Cecil_Martin" } ,
      { "type" : "uri", "value" : "http://dbpedia.org/resource/Neighbourhood_(graph_theory)" } ,
      { "type" : "uri", "value" : "http://dbpedia.org/resource/Intersection_(road)" } ,
      { "type" : "uri", "value" : "http://dbpedia.org/resource/Shortest-path_tree" } ,
      { "type" : "uri", "value" : "http://dbpedia.org/resource/Search_algorithm" } ,
      { "type" : "uri", "value" : "http://dbpedia.org/resource/Category:Edsger_W._Dijkstra" } ,
      { "type" : "uri", "value" : "http://dbpedia.org/resource/Dijkstra's_algorithm" } ,
      { "type" : "uri", "value" : "http://dbpedia.org/resource/Priority_queue" } ,
      { "type" : "uri", "value" : "http://dbpedia.org/resource/Best-first_search" } ,
      { "type" : "uri", "value" : "http://dbpedia.org/resource/Heap_(data_structure)" } ,
      { "type" : "uri", "value" : "http://dbpedia.org/resource/Algorithm" } ,
      { "type" : "uri", "value" : "http://dbpedia.org/resource/A*_search_algorithm" } ,
      { "type" : "uri", "value" : "http://dbpedia.org/resource/Parallel_all-pairs_shortest_path_algorithm" } ,
      { "type" : "uri", "value" : "http://dbpedia.org/resource/Bellman\u2013Ford_algorithm" } ,
      { "type" : "uri", "value" : "http://dbpedia.org/resource/Category:Search_algorithms" } ,
      { "type" : "uri", "value" : "http://dbpedia.org/resource/Depth-first_search" } ,
      { "type" : "uri", "value" : "http://dbpedia.org/resource/Linear_programming" } ,
      { "type" : "uri", "value" : "http://dbpedia.org/resource/Category:Routing_algorithms" } ,
      { "type" : "uri", "value" : "http://dbpedia.org/resource/Directed_graph" } ,
      { "type" : "uri", "value" : "http://dbpedia.org/resource/Total_order" } ,
      { "type" : "uri", "value" : "http://dbpedia.org/resource/Shortest_path_problem" } ,
      { "type" : "uri", "value" : "http://dbpedia.org/resource/Partially_ordered_set" } ,
      { "type" : "uri", "value" : "http://dbpedia.org/resource/Brodal_queue" } ,
      { "type" : "uri", "value" : "http://dbpedia.org/resource/Time_complexity" } ,
      { "type" : "uri", "value" : "http://dbpedia.org/resource/Admissible_heuristic" } ,
      { "type" : "uri", "value" : "http://dbpedia.org/resource/Vojt\u011Bch_Jarn\u00EDk" } ,
      { "type" : "uri", "value" : "http://dbpedia.org/resource/Monotonic_function" } ,
      { "type" : "uri", "value" : "http://dbpedia.org/resource/Amsterdam" } ,
      { "type" : "uri", "value" : "http://dbpedia.org/resource/Groningen" } ,
      { "type" : "uri", "value" : "http://dbpedia.org/resource/Computer_scientist" } ,
      { "type" : "uri", "value" : "http://dbpedia.org/resource/Bellman_equation" } ,
      { "type" : "uri", "value" : "http://dbpedia.org/resource/Big-O_notation" } ,
      { "type" : "uri", "value" : "http://dbpedia.org/resource/Johnson's_algorithm" } ,
      { "type" : "uri", "value" : "http://dbpedia.org/resource/Fast_marching_method" } ,
      { "type" : "uri", "value" : "http://dbpedia.org/resource/A*_algorithm" } ,
      { "type" : "uri", "value" : "http://dbpedia.org/resource/Graph_theory" } ,
      { "type" : "uri", "value" : "http://dbpedia.org/resource/Prim's_algorithm" } ,
      { "type" : "uri", "value" : "http://dbpedia.org/resource/Min-priority_queue" } ,
      { "type" : "uri", "value" : "http://dbpedia.org/resource/Euclidean_shortest_path" } ,
      { "type" : "uri", "value" : "http://dbpedia.org/resource/Radix_heap" } ,
      { "type" : "uri", "value" : "http://dbpedia.org/resource/Robert_C._Prim" } ,
      { "type" : "uri", "value" : "http://dbpedia.org/resource/Transportation_Science" } ,
      { "type" : "uri", "value" : "http://dbpedia.org/resource/Charles_Babbage_Institute" } ,
      { "type" : "uri", "value" : "http://dbpedia.org/resource/Vertex_(graph_theory)" } ,
      { "type" : "uri", "value" : "http://dbpedia.org/resource/Edsger_W._Dijkstra" } ,
      { "type" : "uri", "value" : "http://dbpedia.org/resource/Routing_protocol" } ,
      { "type" : "uri", "value" : "http://dbpedia.org/resource/Fibonacci_heap" } ,
      { "type" : "uri", "value" : "http://dbpedia.org/resource/Artificial_intelligence" } ,
      { "type" : "uri", "value" : "http://dbpedia.org/resource/Open_Shortest_Path_First" } ,
      { "type" : "uri", "value" : "http://dbpedia.org/resource/Pairing_heap" } ,
      { "type" : "uri", "value" : "http://dbpedia.org/resource/IEEE" } ,
      { "type" : "uri", "value" : "http://dbpedia.org/resource/Contraction_hierarchy" } ,
      { "type" : "uri", "value" : "http://dbpedia.org/resource/Sparse_graph" } ,
      { "type" : "uri", "value" : "http://dbpedia.org/resource/Self-balancing_binary_search_tree" } ,
      { "type" : "uri", "value" : "http://dbpedia.org/resource/Negative_cycle" } ,
      { "type" : "uri", "value" : "http://dbpedia.org/resource/A-star_algorithm" } ,
      { "type" : "uri", "value" : "http://dbpedia.org/resource/Category:Graph_algorithms" } ,
      { "type" : "uri", "value" : "http://dbpedia.org/resource/Triviality_(mathematics)" } ,
      { "type" : "uri", "value" : "http://dbpedia.org/resource/Dual_linear_program" } ,
      { "type" : "uri", "value" : "http://dbpedia.org/resource/Dynamic_programming" } ,
      { "type" : "uri", "value" : "http://dbpedia.org/resource/OSPF" } ,
      { "type" : "uri", "value" : "http://dbpedia.org/resource/Adjacency_list" } ,
      { "type" : "uri", "value" : "http://dbpedia.org/resource/Reduced_cost" } ,
      { "type" : "uri", "value" : "http://dbpedia.org/resource/Binary_heap" } ,
      { "type" : "uri", "value" : "http://dbpedia.org/resource/Graph_labeling" } ,
      { "type" : "uri", "value" : "http://dbpedia.org/resource/Communications_of_the_ACM" } ,
      { "type" : "uri", "value" : "http://dbpedia.org/resource/Road_network" } ,
      { "type" : "uri", "value" : "http://dbpedia.org/resource/IS-IS" } ,
      { "type" : "uri", "value" : "http://dbpedia.org/resource/Asymptotic_computational_complexity" } ,
      { "type" : "uri", "value" : "http://dbpedia.org/resource/MIT_Press" } ,
      { "type" : "uri", "value" : "http://dbpedia.org/resource/Best,_worst_and_average_case" } ,
      { "type" : "uri", "value" : "http://dbpedia.org/resource/McGraw\u2013Hill" } ,
      { "type" : "uri", "value" : "http://dbpedia.org/resource/Information_Processing_Letters" } ,
      { "type" : "uri", "value" : "http://dbpedia.org/resource/Richard_Bellman" } ,
      { "type" : "uri", "value" : "http://dbpedia.org/resource/Longest_path_problem" } ] ,
    "http://dbpedia.org/ontology/description" : [ { "type" : "literal", "value" : "\u0926\u094B \u092C\u093F\u0902\u0926\u0941\u0913\u0902 \u0915\u0947 \u092C\u0940\u091A \u0938\u092C\u0938\u0947 \u0938\u0942\u0915\u094D\u0937\u094D\u092E \u092A\u0925 \u0922\u0942\u0902\u0922\u0928\u0947 \u0935\u093E\u0932\u093E \u090F\u0932\u094D\u0917\u094B\u0930\u093F\u0925\u092E" , "lang" : "hi" } ,
      { "type" : "literal", "value" : "topologischer Routing-Algorithmus aus der Klasse der Greedy-Algorithmen" , "lang" : "de" } ,
      { "type" : "literal", "value" : "algoritmo di ricerca grafica" , "lang" : "it" } ,
      { "type" : "literal", "value" : "\u06CC\u06A9\u06CC \u0627\u0632 \u0627\u0644\u06AF\u0648\u0631\u06CC\u062A\u0645\u200C\u0647\u0627\u06CC \u067E\u06CC\u0645\u0627\u06CC\u0634 \u06AF\u0631\u0627\u0641" , "lang" : "fa" } ,
      { "type" : "literal", "value" : "graph search algorithm" , "lang" : "en" } ,
      { "type" : "literal", "value" : "\u4E00\u79CD\u56FE\u641C\u7D22\u7B97\u6CD5\uFF0C\u7528\u4E8E\u5BFB\u627E\u4E24\u70B9\u95F4\u7684\u6700\u77ED\u8DEF" , "lang" : "zh" } ,
      { "type" : "literal", "value" : "\u05D0\u05DC\u05D2\u05D5\u05E8\u05D9\u05EA\u05DD \u05DC\u05DE\u05E6\u05D9\u05D0\u05EA \u05D4\u05DE\u05E1\u05DC\u05D5\u05DC \u05D4\u05E7\u05DC \u05D1\u05D9\u05D5\u05EA\u05E8 \u05DE\u05E7\u05D5\u05D3\u05E7\u05D5\u05D3 \u05DE\u05E7\u05D5\u05E8 \u05DC\u05E7\u05D5\u05D3\u05E7\u05D5\u05D3 \u05D9\u05E2\u05D3 \u05D1\u05D2\u05E8\u05E3 \u05DE\u05DE\u05D5\u05E9\u05E7\u05DC" , "lang" : "iw" } ,
      { "type" : "literal", "value" : "Algoritmo para determinar el camino m\u00E1s corto corto en un grafo con pesos en cada arista" , "lang" : "es" } ,
      { "type" : "literal", "value" : "algoritmus" , "lang" : "cs" } ,
      { "type" : "literal", "value" : "matematikai elj\u00E1r\u00E1s a gr\u00E1f legr\u00F6videbb \u00FAtj\u00E1nak megkeres\u00E9s\u00E9re" , "lang" : "hu" } ,
      { "type" : "literal", "value" : "\u0430\u043B\u0433\u043E\u0440\u0438\u0442\u043C \u043D\u0430 \u0433\u0440\u0430\u0444\u0430\u0445, \u0438\u0437\u043E\u0431\u0440\u0435\u0442\u0451\u043D\u043D\u044B\u0439 \u043D\u0438\u0434\u0435\u0440\u043B\u0430\u043D\u0434\u0441\u043A\u0438\u043C \u0443\u0447\u0435\u043D\u044B\u043C \u042D. \u0414\u0435\u0439\u043A\u0441\u0442\u0440\u043E\u0439 \u0432 1959 \u0433\u043E\u0434\u0443" , "lang" : "ru" } ,
      { "type" : "literal", "value" : "een graaf-algoritme beschreven door Edsger Dijkstra in 1959" , "lang" : "nl" } ,
      { "type" : "literal", "value" : "algorithme de recherche dans un graphe" , "lang" : "fr" } ] ,
    "http://dbpedia.org/property/wikiPageUsesTemplate" : [ { "type" : "uri", "value" : "http://dbpedia.org/resource/Template:Short_description" } ,
      { "type" : "uri", "value" : "http://dbpedia.org/resource/Template:Use_dmy_dates" } ,
      { "type" : "uri", "value" : "http://dbpedia.org/resource/Template:Respell" } ,
      { "type" : "uri", "value" : "http://dbpedia.org/resource/Template:Rp" } ,
      { "type" : "uri", "value" : "http://dbpedia.org/resource/Template:Sfn" } ,
      { "type" : "uri", "value" : "http://dbpedia.org/resource/Template:Blockquote" } ,
      { "type" : "uri", "value" : "http://dbpedia.org/resource/Template:Mono" } ,
      { "type" : "uri", "value" : "http://dbpedia.org/resource/Template:=" } ,
      { "type" : "uri", "value" : "http://dbpedia.org/resource/Template:Slink" } ,
      { "type" : "uri", "value" : "http://dbpedia.org/resource/Template:IPAc-en" } ,
      { "type" : "uri", "value" : "http://dbpedia.org/resource/Template:Code" } ,
      { "type" : "uri", "value" : "http://dbpedia.org/resource/Template:R" } ,
      { "type" : "uri", "value" : "http://dbpedia.org/resource/Template:Mvar" } ,
      { "type" : "uri", "value" : "http://dbpedia.org/resource/Template:Hatnote" } ,
      { "type" : "uri", "value" : "http://dbpedia.org/resource/Template:Harvnb" } ,
      { "type" : "uri", "value" : "http://dbpedia.org/resource/Template:Frac" } ,
      { "type" : "uri", "value" : "http://dbpedia.org/resource/Template:Infobox_algorithm" } ,
      { "type" : "uri", "value" : "http://dbpedia.org/resource/Template:Distinguish" } ,
      { "type" : "uri", "value" : "http://dbpedia.org/resource/Template:Math" } ] ,
    "http://dbpedia.org/property/class" : [ { "type" : "uri", "value" : "http://dbpedia.org/resource/Dynamic_programming" } ,
      { "type" : "uri", "value" : "http://dbpedia.org/resource/Search_algorithm" } ,
      { "type" : "uri", "value" : "http://dbpedia.org/resource/Greedy_algorithm" } ] ,
    "http://dbpedia.org/ontology/wikiPageExternalLink" : [ { "type" : "uri", "value" : "https://dl.acm.org/doi/10.1145/363269.363610" } ,
      { "type" : "uri", "value" : "http://purl.umn.edu/107247" } ,
      { "type" : "uri", "value" : "http://blog.cleancoder.com/uncle-bob/2016/10/26/DijkstrasAlg.html" } ,
      { "type" : "uri", "value" : "https://dspace.mit.edu/bitstream/1721.1/47994/1/fasteralgorithms00sloa.pdf%7Chdl=1721.1/47994%7Chdl-access=free" } ,
      { "type" : "uri", "value" : "http://www.diku.dk/~mthorup/PAPERS/sssp.ps.gz" } ] ,
    "http://dbpedia.org/property/data" : [ { "type" : "literal", "value" : "Usually used with priority queue or heap for optimization" , "lang" : "en" } ,
      { "type" : "uri", "value" : "http://dbpedia.org/resource/Graph_(abstract_data_type)" } ] ,
    "http://dbpedia.org/property/caption" : [ { "type" : "literal", "value" : "Dijkstra's algorithm to find the shortest path between a and b.  It picks the unvisited vertex with the lowest distance, calculates the distance through it to each unvisited neighbor, and updates the neighbor's distance if smaller. Mark visited  when done with neighbors." , "lang" : "en" } ] ,
    "http://dbpedia.org/ontology/thumbnail" : [ { "type" : "uri", "value" : "http://commons.wikimedia.org/wiki/Special:FilePath/Dijkstra_Animation.gif?width=300" } ] } ,
  "http://dbpedia.org/resource/Priority_queue" : { "http://dbpedia.org/ontology/wikiPageWikiLink" : [ { "type" : "uri", "value" : "http://dbpedia.org/resource/Dijkstra's_algorithm" } ] } ,
  "http://dbpedia.org/resource/A*_search_algorithm" : { "http://www.w3.org/2000/01/rdf-schema#seeAlso" : [ { "type" : "uri", "value" : "http://dbpedia.org/resource/Dijkstra's_algorithm" } ] ,
    "http://dbpedia.org/ontology/wikiPageWikiLink" : [ { "type" : "uri", "value" : "http://dbpedia.org/resource/Dijkstra's_algorithm" } ] } ,
  "http://dbpedia.org/resource/Best-first_search" : { "http://dbpedia.org/ontology/wikiPageWikiLink" : [ { "type" : "uri", "value" : "http://dbpedia.org/resource/Dijkstra's_algorithm" } ] } ,
  "http://dbpedia.org/resource/State_space_search" : { "http://dbpedia.org/ontology/wikiPageWikiLink" : [ { "type" : "uri", "value" : "http://dbpedia.org/resource/Dijkstra's_algorithm" } ] } ,
  "http://dbpedia.org/resource/Eikonal_equation" : { "http://dbpedia.org/ontology/wikiPageWikiLink" : [ { "type" : "uri", "value" : "http://dbpedia.org/resource/Dijkstra's_algorithm" } ] } ,
  "http://dbpedia.org/resource/Dykstra's_projection_algorithm" : { "http://www.w3.org/2002/07/owl#differentFrom" : [ { "type" : "uri", "value" : "http://dbpedia.org/resource/Dijkstra's_algorithm" } ] } ,
  "http://dbpedia.org/resource/Flood_fill" : { "http://dbpedia.org/ontology/wikiPageWikiLink" : [ { "type" : "uri", "value" : "http://dbpedia.org/resource/Dijkstra's_algorithm" } ] } ,
  "http://dbpedia.org/resource/Dijkstra" : { "http://dbpedia.org/ontology/wikiPageWikiLink" : [ { "type" : "uri", "value" : "http://dbpedia.org/resource/Dijkstra's_algorithm" } ] ,
    "http://dbpedia.org/ontology/wikiPageDisambiguates" : [ { "type" : "uri", "value" : "http://dbpedia.org/resource/Dijkstra's_algorithm" } ] } ,
  "http://dbpedia.org/resource/Proximity_analysis" : { "http://dbpedia.org/ontology/wikiPageWikiLink" : [ { "type" : "uri", "value" : "http://dbpedia.org/resource/Dijkstra's_algorithm" } ] } ,
  "http://dbpedia.org/resource/Clustering_high-dimensional_data" : { "http://dbpedia.org/ontology/wikiPageWikiLink" : [ { "type" : "uri", "value" : "http://dbpedia.org/resource/Dijkstra's_algorithm" } ] } ,
  "http://dbpedia.org/resource/Glossary_of_artificial_intelligence" : { "http://dbpedia.org/ontology/wikiPageWikiLink" : [ { "type" : "uri", "value" : "http://dbpedia.org/resource/Dijkstra's_algorithm" } ] } ,
  "http://dbpedia.org/resource/OpenLisp" : { "http://dbpedia.org/ontology/wikiPageWikiLink" : [ { "type" : "uri", "value" : "http://dbpedia.org/resource/Dijkstra's_algorithm" } ] } ,
  "http://dbpedia.org/resource/Semantic_similarity" : { "http://dbpedia.org/ontology/wikiPageWikiLink" : [ { "type" : "uri", "value" : "http://dbpedia.org/resource/Dijkstra's_algorithm" } ] } ,
  "http://dbpedia.org/resource/Regular_tree_grammar" : { "http://dbpedia.org/ontology/wikiPageWikiLink" : [ { "type" : "uri", "value" : "http://dbpedia.org/resource/Dijkstra's_algorithm" } ] } ,
  "http://dbpedia.org/resource/Dungeon_Crawl_Stone_Soup" : { "http://dbpedia.org/ontology/wikiPageWikiLink" : [ { "type" : "uri", "value" : "http://dbpedia.org/resource/Dijkstra's_algorithm" } ] } ,
  "http://dbpedia.org/resource/D-ary_heap" : { "http://dbpedia.org/ontology/wikiPageWikiLink" : [ { "type" : "uri", "value" : "http://dbpedia.org/resource/Dijkstra's_algorithm" } ] } ,
  "http://dbpedia.org/resource/Load_balancing_(computing)" : { "http://dbpedia.org/ontology/wikiPageWikiLink" : [ { "type" : "uri", "value" : "http://dbpedia.org/resource/Dijkstra's_algorithm" } ] } ,
  "http://dbpedia.org/resource/Prim's_algorithm" : { "http://dbpedia.org/ontology/wikiPageWikiLink" : [ { "type" : "uri", "value" : "http://dbpedia.org/resource/Dijkstra's_algorithm" } ] } ,
  "http://dbpedia.org/resource/Widest_path_problem" : { "http://dbpedia.org/ontology/wikiPageWikiLink" : [ { "type" : "uri", "value" : "http://dbpedia.org/resource/Dijkstra's_algorithm" } ] } ,
  "http://dbpedia.org/resource/Floyd\u2013Warshall_algorithm" : { "http://dbpedia.org/ontology/wikiPageWikiLink" : [ { "type" : "uri", "value" : "http://dbpedia.org/resource/Dijkstra's_algorithm" } ] } ,
  "http://dbpedia.org/resource/Order_One_Network_Protocol" : { "http://dbpedia.org/ontology/wikiPageWikiLink" : [ { "type" : "uri", "value" : "http://dbpedia.org/resource/Dijkstra's_algorithm" } ] } ,
  "http://dbpedia.org/resource/Data,_context_and_interaction" : { "http://dbpedia.org/ontology/wikiPageWikiLink" : [ { "type" : "uri", "value" : "http://dbpedia.org/resource/Dijkstra's_algorithm" } ] } ,
  "http://dbpedia.org/resource/Bucket_queue" : { "http://dbpedia.org/ontology/wikiPageWikiLink" : [ { "type" : "uri", "value" : "http://dbpedia.org/resource/Dijkstra's_algorithm" } ] } ,
  "http://dbpedia.org/resource/Minimum_bottleneck_spanning_tree" : { "http://dbpedia.org/ontology/wikiPageWikiLink" : [ { "type" : "uri", "value" : "http://dbpedia.org/resource/Dijkstra's_algorithm" } ] } ,
  "http://dbpedia.org/resource/Link-state_routing_protocol" : { "http://dbpedia.org/ontology/wikiPageWikiLink" : [ { "type" : "uri", "value" : "http://dbpedia.org/resource/Dijkstra's_algorithm" } ] } ,
  "http://dbpedia.org/resource/MENTOR_routing_algorithm" : { "http://dbpedia.org/ontology/wikiPageWikiLink" : [ { "type" : "uri", "value" : "http://dbpedia.org/resource/Dijkstra's_algorithm" } ] } ,
  "http://dbpedia.org/resource/Edge_disjoint_shortest_pair_algorithm" : { "http://dbpedia.org/ontology/wikiPageWikiLink" : [ { "type" : "uri", "value" : "http://dbpedia.org/resource/Dijkstra's_algorithm" } ] } ,
  "http://dbpedia.org/resource/Bellman\u2013Ford_algorithm" : { "http://dbpedia.org/ontology/wikiPageWikiLink" : [ { "type" : "uri", "value" : "http://dbpedia.org/resource/Dijkstra's_algorithm" } ] } ,
  "http://dbpedia.org/resource/Reverse-delete_algorithm" : { "http://dbpedia.org/ontology/wikiPageWikiLink" : [ { "type" : "uri", "value" : "http://dbpedia.org/resource/Dijkstra's_algorithm" } ] } ,
  "http://dbpedia.org/resource/Real-time_path_planning" : { "http://dbpedia.org/ontology/wikiPageWikiLink" : [ { "type" : "uri", "value" : "http://dbpedia.org/resource/Dijkstra's_algorithm" } ] } ,
  "http://dbpedia.org/resource/Rapidly-exploring_random_tree" : { "http://dbpedia.org/ontology/wikiPageWikiLink" : [ { "type" : "uri", "value" : "http://dbpedia.org/resource/Dijkstra's_algorithm" } ] } ,
  "http://dbpedia.org/resource/Suurballe's_algorithm" : { "http://dbpedia.org/ontology/wikiPageWikiLink" : [ { "type" : "uri", "value" : "http://dbpedia.org/resource/Dijkstra's_algorithm" } ] } ,
  "http://dbpedia.org/resource/Seam_carving" : { "http://dbpedia.org/ontology/wikiPageWikiLink" : [ { "type" : "uri", "value" : "http://dbpedia.org/resource/Dijkstra's_algorithm" } ] } ,
  "http://dbpedia.org/resource/GraphHopper" : { "http://dbpedia.org/ontology/wikiPageWikiLink" : [ { "type" : "uri", "value" : "http://dbpedia.org/resource/Dijkstra's_algorithm" } ] } ,
  "http://dbpedia.org/resource/Yen's_algorithm" : { "http://dbpedia.org/ontology/wikiPageWikiLink" : [ { "type" : "uri", "value" : "http://dbpedia.org/resource/Dijkstra's_algorithm" } ] } ,
  "http://dbpedia.org/resource/Dijkstra's_Algorithm" : { "http://dbpedia.org/ontology/wikiPageWikiLink" : [ { "type" : "uri", "value" : "http://dbpedia.org/resource/Dijkstra's_algorithm" } ] ,
    "http://dbpedia.org/ontology/wikiPageRedirects" : [ { "type" : "uri", "value" : "http://dbpedia.org/resource/Dijkstra's_algorithm" } ] } ,
  "http://dbpedia.org/resource/Friction_of_distance" : { "http://dbpedia.org/ontology/wikiPageWikiLink" : [ { "type" : "uri", "value" : "http://dbpedia.org/resource/Dijkstra's_algorithm" } ] } ,
  "http://dbpedia.org/resource/List_of_graph_theory_topics" : { "http://dbpedia.org/ontology/wikiPageWikiLink" : [ { "type" : "uri", "value" : "http://dbpedia.org/resource/Dijkstra's_algorithm" } ] } ,
  "http://dbpedia.org/resource/Facility_location_problem" : { "http://dbpedia.org/ontology/wikiPageWikiLink" : [ { "type" : "uri", "value" : "http://dbpedia.org/resource/Dijkstra's_algorithm" } ] } ,
  "http://dbpedia.org/resource/Johnson's_algorithm" : { "http://dbpedia.org/ontology/wikiPageWikiLink" : [ { "type" : "uri", "value" : "http://dbpedia.org/resource/Dijkstra's_algorithm" } ] } ,
  "http://dbpedia.org/resource/Graph_theory" : { "http://dbpedia.org/ontology/wikiPageWikiLink" : [ { "type" : "uri", "value" : "http://dbpedia.org/resource/Dijkstra's_algorithm" } ] } ,
  "http://dbpedia.org/resource/Dynamic_programming" : { "http://dbpedia.org/ontology/wikiPageWikiLink" : [ { "type" : "uri", "value" : "http://dbpedia.org/resource/Dijkstra's_algorithm" } ] } ,
  "http://dbpedia.org/resource/Routing" : { "http://dbpedia.org/ontology/wikiPageWikiLink" : [ { "type" : "uri", "value" : "http://dbpedia.org/resource/Dijkstra's_algorithm" } ] } ,
  "http://dbpedia.org/resource/Optical_mesh_network" : { "http://dbpedia.org/ontology/wikiPageWikiLink" : [ { "type" : "uri", "value" : "http://dbpedia.org/resource/Dijkstra's_algorithm" } ] } ,
  "http://dbpedia.org/resource/Velvet_assembler" : { "http://dbpedia.org/ontology/wikiPageWikiLink" : [ { "type" : "uri", "value" : "http://dbpedia.org/resource/Dijkstra's_algorithm" } ] } ,
  "http://dbpedia.org/resource/Consistent_heuristic" : { "http://dbpedia.org/ontology/wikiPageWikiLink" : [ { "type" : "uri", "value" : "http://dbpedia.org/resource/Dijkstra's_algorithm" } ] } ,
  "http://dbpedia.org/resource/IEEE_802.1aq" : { "http://dbpedia.org/ontology/wikiPageWikiLink" : [ { "type" : "uri", "value" : "http://dbpedia.org/resource/Dijkstra's_algorithm" } ] } ,
  "http://dbpedia.org/resource/Multi-chassis_link_aggregation_group" : { "http://dbpedia.org/ontology/wikiPageWikiLink" : [ { "type" : "uri", "value" : "http://dbpedia.org/resource/Dijkstra's_algorithm" } ] } ,
  "http://dbpedia.org/resource/Network_bridge" : { "http://dbpedia.org/ontology/wikiPageWikiLink" : [ { "type" : "uri", "value" : "http://dbpedia.org/resource/Dijkstra's_algorithm" } ] } ,
  "http://dbpedia.org/resource/Livewire_Segmentation_Technique" : { "http://dbpedia.org/ontology/wikiPageWikiLink" : [ { "type" : "uri", "value" : "http://dbpedia.org/resource/Dijkstra's_algorithm" } ] } ,
  "http://dbpedia.org/resource/Visibility_graph" : { "http://dbpedia.org/ontology/wikiPageWikiLink" : [ { "type" : "uri", "value" : "http://dbpedia.org/resource/Dijkstra's_algorithm" } ] } ,
  "http://dbpedia.org/resource/Uniform-cost_search" : { "http://dbpedia.org/ontology/wikiPageWikiLink" : [ { "type" : "uri", "value" : "http://dbpedia.org/resource/Dijkstra's_algorithm" } ] ,
    "http://dbpedia.org/ontology/wikiPageRedirects" : [ { "type" : "uri", "value" : "http://dbpedia.org/resource/Dijkstra's_algorithm" } ] } ,
  "http://dbpedia.org/resource/Fisheye_State_Routing" : { "http://dbpedia.org/ontology/wikiPageWikiLink" : [ { "type" : "uri", "value" : "http://dbpedia.org/resource/Dijkstra's_algorithm" } ] } ,
  "http://dbpedia.org/resource/Sorted_array" : { "http://dbpedia.org/ontology/wikiPageWikiLink" : [ { "type" : "uri", "value" : "http://dbpedia.org/resource/Dijkstra's_algorithm" } ] } ,
  "http://dbpedia.org/resource/Shared_Risk_Resource_Group" : { "http://dbpedia.org/ontology/wikiPageWikiLink" : [ { "type" : "uri", "value" : "http://dbpedia.org/resource/Dijkstra's_algorithm" } ] } ,
  "http://dbpedia.org/resource/Isomap" : { "http://dbpedia.org/ontology/wikiPageWikiLink" : [ { "type" : "uri", "value" : "http://dbpedia.org/resource/Dijkstra's_algorithm" } ] } ,
  "http://dbpedia.org/resource/Dijkstra_algorithm" : { "http://dbpedia.org/ontology/wikiPageWikiLink" : [ { "type" : "uri", "value" : "http://dbpedia.org/resource/Dijkstra's_algorithm" } ] ,
    "http://dbpedia.org/ontology/wikiPageRedirects" : [ { "type" : "uri", "value" : "http://dbpedia.org/resource/Dijkstra's_algorithm" } ] } ,
  "http://dbpedia.org/resource/Transit_node_routing" : { "http://dbpedia.org/ontology/wikiPageWikiLink" : [ { "type" : "uri", "value" : "http://dbpedia.org/resource/Dijkstra's_algorithm" } ] } ,
  "http://dbpedia.org/resource/Dykstra's_algorithm" : { "http://dbpedia.org/ontology/wikiPageWikiLink" : [ { "type" : "uri", "value" : "http://dbpedia.org/resource/Dijkstra's_algorithm" } ] ,
    "http://dbpedia.org/ontology/wikiPageRedirects" : [ { "type" : "uri", "value" : "http://dbpedia.org/resource/Dijkstra's_algorithm" } ] } ,
  "http://dbpedia.org/resource/D\u0133kstra's_algorithm" : { "http://dbpedia.org/ontology/wikiPageWikiLink" : [ { "type" : "uri", "value" : "http://dbpedia.org/resource/Dijkstra's_algorithm" } ] ,
    "http://dbpedia.org/ontology/wikiPageRedirects" : [ { "type" : "uri", "value" : "http://dbpedia.org/resource/Dijkstra's_algorithm" } ] } ,
  "http://dbpedia.org/resource/Dial's_algorithm" : { "http://dbpedia.org/ontology/wikiPageWikiLink" : [ { "type" : "uri", "value" : "http://dbpedia.org/resource/Dijkstra's_algorithm" } ] ,
    "http://dbpedia.org/ontology/wikiPageRedirects" : [ { "type" : "uri", "value" : "http://dbpedia.org/resource/Dijkstra's_algorithm" } ] } ,
  "http://dbpedia.org/resource/Dijkstra'_algorithm" : { "http://dbpedia.org/ontology/wikiPageWikiLink" : [ { "type" : "uri", "value" : "http://dbpedia.org/resource/Dijkstra's_algorithm" } ] ,
    "http://dbpedia.org/ontology/wikiPageRedirects" : [ { "type" : "uri", "value" : "http://dbpedia.org/resource/Dijkstra's_algorithm" } ] } ,
  "http://dbpedia.org/resource/Dijkstra's_algo" : { "http://dbpedia.org/ontology/wikiPageWikiLink" : [ { "type" : "uri", "value" : "http://dbpedia.org/resource/Dijkstra's_algorithm" } ] ,
    "http://dbpedia.org/ontology/wikiPageRedirects" : [ { "type" : "uri", "value" : "http://dbpedia.org/resource/Dijkstra's_algorithm" } ] } ,
  "http://dbpedia.org/resource/Dijkstra's_distance_algorithm" : { "http://dbpedia.org/ontology/wikiPageWikiLink" : [ { "type" : "uri", "value" : "http://dbpedia.org/resource/Dijkstra's_algorithm" } ] ,
    "http://dbpedia.org/ontology/wikiPageRedirects" : [ { "type" : "uri", "value" : "http://dbpedia.org/resource/Dijkstra's_algorithm" } ] } ,
  "http://dbpedia.org/resource/Dijkstra's_shortest_path_algorithm" : { "http://dbpedia.org/ontology/wikiPageWikiLink" : [ { "type" : "uri", "value" : "http://dbpedia.org/resource/Dijkstra's_algorithm" } ] ,
    "http://dbpedia.org/ontology/wikiPageRedirects" : [ { "type" : "uri", "value" : "http://dbpedia.org/resource/Dijkstra's_algorithm" } ] } ,
  "http://dbpedia.org/resource/Dijkstra_algo" : { "http://dbpedia.org/ontology/wikiPageWikiLink" : [ { "type" : "uri", "value" : "http://dbpedia.org/resource/Dijkstra's_algorithm" } ] ,
    "http://dbpedia.org/ontology/wikiPageRedirects" : [ { "type" : "uri", "value" : "http://dbpedia.org/resource/Dijkstra's_algorithm" } ] } ,
  "http://dbpedia.org/resource/Dijkstras_Algorithm" : { "http://dbpedia.org/ontology/wikiPageWikiLink" : [ { "type" : "uri", "value" : "http://dbpedia.org/resource/Dijkstra's_algorithm" } ] ,
    "http://dbpedia.org/ontology/wikiPageRedirects" : [ { "type" : "uri", "value" : "http://dbpedia.org/resource/Dijkstra's_algorithm" } ] } ,
  "http://dbpedia.org/resource/Dijkstras_algorithm" : { "http://dbpedia.org/ontology/wikiPageWikiLink" : [ { "type" : "uri", "value" : "http://dbpedia.org/resource/Dijkstra's_algorithm" } ] ,
    "http://dbpedia.org/ontology/wikiPageRedirects" : [ { "type" : "uri", "value" : "http://dbpedia.org/resource/Dijkstra's_algorithm" } ] } ,
  "http://dbpedia.org/resource/Dijkstra\u2019s_Algorithm" : { "http://dbpedia.org/ontology/wikiPageWikiLink" : [ { "type" : "uri", "value" : "http://dbpedia.org/resource/Dijkstra's_algorithm" } ] ,
    "http://dbpedia.org/ontology/wikiPageRedirects" : [ { "type" : "uri", "value" : "http://dbpedia.org/resource/Dijkstra's_algorithm" } ] } ,
  "http://dbpedia.org/resource/Dikjstra's_algorithm" : { "http://dbpedia.org/ontology/wikiPageWikiLink" : [ { "type" : "uri", "value" : "http://dbpedia.org/resource/Dijkstra's_algorithm" } ] ,
    "http://dbpedia.org/ontology/wikiPageRedirects" : [ { "type" : "uri", "value" : "http://dbpedia.org/resource/Dijkstra's_algorithm" } ] } ,
  "http://dbpedia.org/resource/Dikjstras_algorithm" : { "http://dbpedia.org/ontology/wikiPageWikiLink" : [ { "type" : "uri", "value" : "http://dbpedia.org/resource/Dijkstra's_algorithm" } ] ,
    "http://dbpedia.org/ontology/wikiPageRedirects" : [ { "type" : "uri", "value" : "http://dbpedia.org/resource/Dijkstra's_algorithm" } ] } ,
  "http://dbpedia.org/resource/Djikstra's_Algorithm" : { "http://dbpedia.org/ontology/wikiPageWikiLink" : [ { "type" : "uri", "value" : "http://dbpedia.org/resource/Dijkstra's_algorithm" } ] ,
    "http://dbpedia.org/ontology/wikiPageRedirects" : [ { "type" : "uri", "value" : "http://dbpedia.org/resource/Dijkstra's_algorithm" } ] } ,
  "http://dbpedia.org/resource/Djikstra's_algorithm" : { "http://dbpedia.org/ontology/wikiPageWikiLink" : [ { "type" : "uri", "value" : "http://dbpedia.org/resource/Dijkstra's_algorithm" } ] ,
    "http://dbpedia.org/ontology/wikiPageRedirects" : [ { "type" : "uri", "value" : "http://dbpedia.org/resource/Dijkstra's_algorithm" } ] } ,
  "http://dbpedia.org/resource/Generalizations_of_Dijkstra's_algorithm" : { "http://dbpedia.org/ontology/wikiPageWikiLink" : [ { "type" : "uri", "value" : "http://dbpedia.org/resource/Dijkstra's_algorithm" } ] ,
    "http://dbpedia.org/ontology/wikiPageRedirects" : [ { "type" : "uri", "value" : "http://dbpedia.org/resource/Dijkstra's_algorithm" } ] } ,
  "http://dbpedia.org/resource/Uniform_cost_search" : { "http://dbpedia.org/ontology/wikiPageWikiLink" : [ { "type" : "uri", "value" : "http://dbpedia.org/resource/Dijkstra's_algorithm" } ] ,
    "http://dbpedia.org/ontology/wikiPageRedirects" : [ { "type" : "uri", "value" : "http://dbpedia.org/resource/Dijkstra's_algorithm" } ] } ,
  "http://dbpedia.org/resource/SPF_Algorithm" : { "http://dbpedia.org/ontology/wikiPageWikiLink" : [ { "type" : "uri", "value" : "http://dbpedia.org/resource/Dijkstra's_algorithm" } ] ,
    "http://dbpedia.org/ontology/wikiPageRedirects" : [ { "type" : "uri", "value" : "http://dbpedia.org/resource/Dijkstra's_algorithm" } ] } ,
  "http://dbpedia.org/resource/Shortest_path_first" : { "http://dbpedia.org/ontology/wikiPageWikiLink" : [ { "type" : "uri", "value" : "http://dbpedia.org/resource/Dijkstra's_algorithm" } ] ,
    "http://dbpedia.org/ontology/wikiPageRedirects" : [ { "type" : "uri", "value" : "http://dbpedia.org/resource/Dijkstra's_algorithm" } ] } ,
  "http://dbpedia.org/resource/Segment_protection" : { "http://dbpedia.org/ontology/wikiPageWikiLink" : [ { "type" : "uri", "value" : "http://dbpedia.org/resource/Dijkstra's_algorithm" } ] }
}