Dijkstra's shortest path algorithm
GPTKB entity
Statements (54)
| Predicate | Object |
|---|---|
| gptkbp:instance_of |
gptkb:Artificial_Intelligence
|
| gptkbp:analyzes |
graph representations
|
| gptkbp:can_handle |
non-negative weights
|
| gptkbp:designed_by |
gptkb:Edsger_W._Dijkstra
|
| gptkbp:has_time_complexity |
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_applied_in |
GPS navigation systems
|
| gptkbp:is_greedy_algorithm |
gptkb:true
|
| gptkbp:is_implemented_in |
various programming languages
many software libraries |
| gptkbp:is_not_optimal_for |
all-pairs shortest path problem
|
| gptkbp:is_optimized_for |
single-source shortest path problem
|
| gptkbp:is_part_of |
graph theory
|
| gptkbp:is_related_to |
A* search algorithm
Bellman-Ford algorithm |
| gptkbp:is_taught_in |
computer science courses
|
| gptkbp:is_used_in |
gptkb:Telecommunications
gptkb:cloud_computing gptkb:urban_planning gptkb:supply_chain_management 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_in |
gptkb:1956
|
| gptkbp:requires_initialization |
all other node distances to infinity
source node distance to zero |
| gptkbp:suitable_for |
graphs with negative weight edges
|
| gptkbp:updates_distances |
to neighboring nodes
|
| gptkbp:used_for |
finding the shortest path in a graph
|
| gptkbp:uses_data_structure |
priority queue
|
| gptkbp:works_on |
weighted graphs
|
| gptkbp:bfsParent |
gptkb:Edsger_W._Dijkstra
|
| gptkbp:bfsLayer |
4
|