Properties (58)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
algorithm
|
| gptkbp:appliesTo |
weighted graphs
|
| gptkbp:canLeadTo |
graph representation
|
| gptkbp:designedBy |
gptkb:Edsger_W._Dijkstra
|
| gptkbp:firstIntroduced |
1956
|
| https://www.w3.org/2000/01/rdf-schema#label |
Dijkstra's algorithm
|
| gptkbp:isEvaluatedBy |
space complexity analysis
time complexity analysis |
| gptkbp:isFocusedOn |
true
|
| gptkbp:isLocatedIn |
software applications
various programming languages graph libraries |
| gptkbp:isNamedAfter |
gptkb:Edsger_W._Dijkstra
|
| gptkbp:isNotableFor |
graphs with negative weight edges
|
| gptkbp:isOffering |
non-negative edge weights
|
| gptkbp:isPartOf |
algorithm design
graph theory graph traversal algorithms |
| gptkbp:isRelatedTo |
A* search algorithm
shortest path problem |
| gptkbp:isSimilarTo |
Bellman-Ford_algorithm
|
| gptkbp:isTaughtIn |
computer science courses
|
| gptkbp:isUsedFor |
priority queue
handle dynamic graphs solve routing problems |
| gptkbp:isUsedIn |
telecommunications
cloud computing data analysis machine learning urban planning game development logistics optimization real-time systems resource allocation robotics supply chain management GPS navigation systems data mining distributed systems network design information retrieval social network analysis transportation networks network routing protocols computer networking database optimization web crawling AI pathfinding internet routing robot path planning automated driving systems pathfinding in AI |
| gptkbp:requires |
initialization of distances
|
| gptkbp:respondsTo |
shortest path tree
|
| gptkbp:timeZone |
O(V^2)
O(E + V log V) |
| gptkbp:updates |
distance_estimates
|
| gptkbp:usedFor |
finding the shortest path
|