|
gptkbp:instanceOf
|
gptkb:algorithm
Graph algorithm
|
|
gptkbp:alternativeName
|
Single-source shortest path algorithm
|
|
gptkbp:appliesTo
|
Directed graphs
Undirected graphs
|
|
gptkbp:cannotHandle
|
Negative edge weights
|
|
gptkbp:category
|
Greedy algorithm
|
|
gptkbp:complexity
|
O(V^2)
O((V+E) log V)
|
|
gptkbp:complexityDependsOn
|
Graph representation
|
|
gptkbp:dataStructureUsed
|
Priority queue
Min-heap
|
|
gptkbp:designedBy
|
gptkb:Edsger_W._Dijkstra
|
|
gptkbp:field
|
gptkb:Mathematics
Computer science
Operations research
|
|
gptkbp:firstPublished
|
1959
|
|
https://www.w3.org/2000/01/rdf-schema#label
|
Dijkstra's Algorithm
|
|
gptkbp:influenced
|
Modern navigation systems
Network routing protocols
Pathfinding in games
|
|
gptkbp:input
|
Source vertex
Weighted graph
|
|
gptkbp:introducedIn
|
1956
|
|
gptkbp:namedAfter
|
gptkb:Edsger_W._Dijkstra
|
|
gptkbp:notRecommendedFor
|
Graphs with negative cycles
|
|
gptkbp:openSource
|
gptkb:Java
gptkb:Python
gptkb:NetworkX
gptkb:C++
gptkb:Boost_Graph_Library
|
|
gptkbp:output
|
Shortest path distances
Shortest path tree
|
|
gptkbp:programmingLanguage
|
Yes
|
|
gptkbp:publishedIn
|
gptkb:Numerische_Mathematik
|
|
gptkbp:relatedTo
|
gptkb:A*_search_algorithm
gptkb:Bellman-Ford_algorithm
gptkb:Floyd-Warshall_algorithm
|
|
gptkbp:requires
|
Non-negative edge weights
|
|
gptkbp:solvedBy
|
Single-source shortest path problem
|
|
gptkbp:step
|
Initialize distances
Repeat until all vertices processed
Select minimum distance vertex
Update distances of neighbors
|
|
gptkbp:usedIn
|
Routing
Geographic information systems
Network analysis
|
|
gptkbp:widelyTaughtIn
|
Computer science curricula
|
|
gptkbp:bfsParent
|
gptkb:Graph_Algorithms
|
|
gptkbp:bfsLayer
|
6
|