Statements (33)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
graph
|
| gptkbp:application |
gptkb:transportation
logistics robotics network routing |
| gptkbp:canHaveNegativeWeights |
yes (with Bellman-Ford)
|
| gptkbp:cannotHaveNegativeCycles |
true
|
| gptkbp:complexity |
varies by algorithm
|
| gptkbp:field |
gptkb:mathematics
computer science operations research |
| gptkbp:firstDescribed |
1950s
|
| https://www.w3.org/2000/01/rdf-schema#label |
Shortest Path Problem
|
| gptkbp:input |
weighted graph
destination node source node |
| gptkbp:notableContributor |
gptkb:Edsger_W._Dijkstra
|
| gptkbp:output |
shortest path
path length |
| gptkbp:relatedTo |
gptkb:Minimum_Spanning_Tree
gptkb:Traveling_Salesman_Problem Network Flow Problem |
| gptkbp:solvedBy |
gptkb:Dijkstra's_algorithm
gptkb:Bellman-Ford_algorithm gptkb:Floyd-Warshall_algorithm gptkb:A*_algorithm |
| gptkbp:variant |
single-source shortest path
all-pairs shortest path constrained shortest path problem k-shortest paths problem single-destination shortest path |
| gptkbp:bfsParent |
gptkb:Graph_Algorithms
|
| gptkbp:bfsLayer |
6
|