Dijkstra's shortest path algorithm
GPTKB entity
Statements (55)
| Predicate | Object |
|---|---|
| gptkbp:instance_of |
gptkb:Artificial_Intelligence
|
| gptkbp:analyzes |
graph representations
|
| gptkbp:applies_to |
GPS navigation systems
|
| gptkbp:controls |
non-negative weights
|
| gptkbp:data_type |
priority queue
|
| gptkbp:designed_by |
gptkb:Edsger_W._Dijkstra
|
| gptkbp:distance |
to neighboring nodes
|
| gptkbp:has_ability |
O(V^2) or O(E + V log V)
|
| gptkbp:has_variants |
Bidirectional Dijkstra's algorithm
|
| https://www.w3.org/2000/01/rdf-schema#label |
Dijkstra's shortest path algorithm
|
| gptkbp:is_implemented_in |
various programming languages
many software libraries |
| gptkbp:is_optimized_for |
gptkb:theorem
all-pairs shortest path problem single-source shortest path problem |
| gptkbp:is_part_of |
graph theory
|
| gptkbp:is_related_to |
A* search algorithm
Bellman-Ford algorithm |
| gptkbp:is_used_for |
finding the shortest path in a graph
|
| gptkbp:is_used_in |
gptkb:Company
gptkb:Cloud_Computing_Service gptkb:metropolitan_area gptkb:Telecommunications_company computer networks data visualization game development logistics optimization real-time systems resource allocation search engines data mining distributed systems network design optimization problems recommendation systems social network analysis network routing protocols transportation logistics data routing internet traffic management routing algorithms AI pathfinding automated planning robot path planning pathfinding in AI |
| gptkbp:named_after |
gptkb:Edsger_W._Dijkstra
|
| gptkbp:published_by |
gptkb:1956
|
| gptkbp:requires |
all other node distances to infinity
source node distance to zero |
| gptkbp:suitable_for |
graphs with negative weight edges
|
| gptkbp:training |
computer science courses
|
| gptkbp:works_on |
weighted graphs
|
| gptkbp:bfsParent |
gptkb:Edsger_W._Dijkstra
gptkb:Dijkstra |
| gptkbp:bfsLayer |
4
|