Statements (28)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
gptkb:graph
|
| gptkbp:application |
gptkb:transportation
gptkb:geographic_information_systems robotics network routing |
| gptkbp:complexity |
varies by algorithm
|
| gptkbp:field |
gptkb:mathematics
computer science operations research |
| gptkbp:firstDescribed |
1950s
|
| gptkbp:hasVariant |
all-pairs shortest path problem
single-source shortest path problem single-destination shortest path problem single-pair shortest path problem |
| gptkbp:input |
weighted graph
|
| gptkbp:output |
shortest path
|
| gptkbp:relatedTo |
gptkb:graph
weight edge vertex |
| gptkbp:solvedBy |
gptkb:Dijkstra's_algorithm
gptkb:Bellman-Ford_algorithm gptkb:Floyd-Warshall_algorithm gptkb:Johnson's_algorithm gptkb:A*_algorithm |
| gptkbp:bfsParent |
gptkb:Moore's_algorithm
|
| gptkbp:bfsLayer |
6
|
| https://www.w3.org/2000/01/rdf-schema#label |
shortest path problem
|