This HTML5 document contains 148 embedded RDF statements represented using HTML+Microdata notation.

The embedded RDF content will be recognized by any processor of HTML5 Microdata.

Namespace Prefixes

PrefixIRI
dcthttp://purl.org/dc/terms/
yago-reshttp://yago-knowledge.org/resource/
dbohttp://dbpedia.org/ontology/
foafhttp://xmlns.com/foaf/0.1/
n12http://dbpedia.org/resource/File:
dbthttp://dbpedia.org/resource/Template:
rdfshttp://www.w3.org/2000/01/rdf-schema#
freebasehttp://rdf.freebase.com/ns/
n4http://commons.wikimedia.org/wiki/Special:FilePath/
rdfhttp://www.w3.org/1999/02/22-rdf-syntax-ns#
owlhttp://www.w3.org/2002/07/owl#
n15http://en.wikipedia.org/wiki/
dbchttp://dbpedia.org/resource/Category:
dbphttp://dbpedia.org/property/
provhttp://www.w3.org/ns/prov#
xsdhhttp://www.w3.org/2001/XMLSchema#
dbrhttp://dbpedia.org/resource/

Statements

Subject Item
dbr:Dijkstra's_algorithm
rdf:type
owl:Thing
rdfs:label
Dijkstra's algorithm
rdfs:comment
Dijkstra's algorithm (/ˈdaɪkstrəz/ DYKE-strəz) is an algorithm for finding the shortest paths between nodes in a graph, which may represent, for example, road networks. It was conceived by computer scientist Edsger W. Dijkstra in 1956 and published three years later. The algorithm exists in many variants. Dijkstra's original algorithm found the shortest path between two given nodes, but a more common variant fixes a single node as the "source" node and finds shortest paths from the source to all other nodes in the graph, producing a shortest-path tree.
owl:differentFrom
dbr:Dykstra's_projection_algorithm
owl:sameAs
freebase:m.0cf7t yago-res:Dijkstra's_algorithm
dbp:wikiPageUsesTemplate
dbt:Infobox_algorithm dbt:Respell dbt:Harvnb dbt:Short_description dbt:= dbt:Rp dbt:Edsger_Dijkstra dbt:Frac dbt:Mvar dbt:IPAc-en dbt:Reflist dbt:Math dbt:Optimization_algorithms dbt:Harv dbt:Hatnote dbt:Cite_book dbt:Cite_conference dbt:Use_dmy_dates dbt:Cite_journal dbt:Slink dbt:Quote dbt:R dbt:Mono dbt:Distinguish dbt:Graph_search_algorithm dbt:Commons_category
dct:subject
dbc:Search_algorithms dbc:1959_in_computing dbc:Routing_algorithms dbc:Graph_distance dbc:Edsger_W._Dijkstra dbc:Articles_with_example_pseudocode dbc:Combinatorial_optimization dbc:Dutch_inventions dbc:Graph_algorithms
dbo:thumbnail
n4:Dijkstra_Animation.gif?width=300
foaf:depiction
n4:Dijkstras_progress_animation.gif n4:Dijkstra_Animation.gif n4:DijkstraDemo.gif
prov:wasDerivedFrom
n15:Dijkstra's_algorithm?oldid=1074619498&ns=0
dbo:wikiPageID
45809
dbo:wikiPageLength
47376
dbo:wikiPageRevisionID
1074619498
dbo:wikiPageWikiLink
dbr:Graph_theory dbr:Fast_marching_method dbr:Triviality_(mathematics) dbr:Richard_E._Bellman dbr:Bellman_equation dbc:Combinatorial_optimization dbr:Greedy_algorithm dbr:Algorithm dbr:Time_complexity dbr:Minimum_spanning_tree dbc:Edsger_W._Dijkstra dbc:Search_algorithms dbr:Routing_protocol dbr:Fibonacci_heap dbr:Intersection_(road) dbc:1959_in_computing dbr:Brodal_queue dbr:Partially_ordered_set dbr:Heap_(data_structure) dbr:Dijkstra's_algorithm dbr:Monotonic_function dbr:Pseudocode dbr:Johnson's_algorithm dbr:Dynamic_programming dbr:Self-balancing_binary_search_tree dbr:Pairing_heap dbr:Robert_C._Martin dbr:Computer_scientist dbr:Centrum_Wiskunde_&_Informatica dbr:Robert_C._Prim dbr:Parallel_all-pairs_shortest_path_algorithm dbr:Vertex_(graph_theory) dbr:Floyd–Warshall_algorithm dbr:Set_(abstract_data_type) dbr:Artificial_intelligence dbr:Neighbourhood_(graph_theory) dbr:Van_Emde_Boas_tree dbr:Asymptotic_computational_complexity dbr:Transportation_Science dbr:Priority_queue dbr:Best-first_search dbr:Rotterdam dbr:Bellman–Ford_algorithm dbr:Street_network dbr:Dense_graph dbr:Contraction_hierarchies dbr:Bucket_queue dbr:Graph_(abstract_data_type) dbr:Amsterdam n12:DijkstraDemo.gif dbr:Admissible_heuristic dbr:Big_O_notation n12:Dijkstras_progress_animation.gif dbc:Graph_algorithms dbr:Binary_heap dbr:Best,_worst_and_average_case dbr:Adjacency_matrix dbr:Probability_distribution dbr:Cost_distance_analysis dbr:Institute_of_Electrical_and_Electronics_Engineers dbr:Link-state_routing_protocol dbr:Adjacency_list dbr:Depth-first_search dbr:Edsger_W._Dijkstra dbr:S&P_Global dbr:Prim's_algorithm dbc:Articles_with_example_pseudocode dbr:Search_algorithm dbr:Groningen dbr:Charles_Babbage_Institute dbr:Transit_node_routing dbr:Open_Shortest_Path_First dbr:Theoretical_computer_science dbr:Information_Processing_Letters dbr:Subroutine dbr:Graph_labeling dbr:IS-IS dbr:Dual_linear_program dbr:Directed_graph dbc:Graph_distance dbr:Vojtěch_Jarník dbr:Shortest_path_problem dbr:Euclidean_shortest_path dbr:Total_order dbr:Communications_of_the_ACM dbr:MIT_Press dbr:Radix_heap dbr:Linear_programming dbr:Breadth-first_search dbr:Shortest-path_tree dbr:Consistent_heuristic dbc:Routing_algorithms dbr:Longest_path_problem dbr:Reduced_cost dbr:A*_search_algorithm dbc:Dutch_inventions dbr:Bidirectional_search
dbo:abstract
Dijkstra's algorithm (/ˈdaɪkstrəz/ DYKE-strəz) is an algorithm for finding the shortest paths between nodes in a graph, which may represent, for example, road networks. It was conceived by computer scientist Edsger W. Dijkstra in 1956 and published three years later. The algorithm exists in many variants. Dijkstra's original algorithm found the shortest path between two given nodes, but a more common variant fixes a single node as the "source" node and finds shortest paths from the source to all other nodes in the graph, producing a shortest-path tree. For a given source node in the graph, the algorithm finds the shortest path between that node and every other. It can also be used for finding the shortest paths from a single node to a single destination node by stopping the algorithm once the shortest path to the destination node has been determined. For example, if the nodes of the graph represent cities and edge path costs represent driving distances between pairs of cities connected by a direct road (for simplicity, ignore red lights, stop signs, toll roads and other obstructions), Dijkstra's algorithm can be used to find the shortest route between one city and all other cities. A widely used application of shortest path algorithms is network routing protocols, most notably IS-IS (Intermediate System to Intermediate System) and Open Shortest Path First (OSPF). It is also employed as a subroutine in other algorithms such as Johnson's. The Dijkstra algorithm uses labels that are positive integers or real numbers, which are totally ordered. It can be generalized to use any labels that are partially ordered, provided the subsequent labels (a subsequent label is produced when traversing an edge) are monotonically non-decreasing. This generalization is called the generic Dijkstra shortest-path algorithm. Dijkstra's algorithm uses a data structure for storing and querying partial solutions sorted by distance from the start. While the original algorithm uses a min-priority queue and runs in time (where is the number of nodes and is the number of edges), it can also be implemented in using an array. The idea of this algorithm is also given in . propose using a Fibonacci heap min-priority queue to optimize the running time complexity to . This is asymptotically the fastest known single-source shortest-path algorithm for arbitrary directed graphs with unbounded non-negative weights. However, specialized cases (such as bounded/integer weights, directed acyclic graphs etc.) can indeed be improved further as detailed in Specialized variants. Additionally, if preprocessing is allowed algorithms such as contraction hierarchies can be up to seven orders of magnitude faster. In some fields, artificial intelligence in particular, Dijkstra's algorithm or a variant of it is known as uniform cost search and formulated as an instance of the more general idea of best-first search.
foaf:isPrimaryTopicOf
n15:Dijkstra's_algorithm