Statements (18)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
gptkb:algorithm
|
| gptkbp:alsoKnownAs |
gptkb:Bellman–Ford–Moore_algorithm
|
| gptkbp:canBe |
negative edge weights
|
| gptkbp:cannotHandle |
negative cycles
|
| gptkbp:category |
graph algorithms
|
| gptkbp:complexity |
O(VE)
|
| gptkbp:field |
computer science
graph theory |
| gptkbp:firstPublished |
1957
|
| https://www.w3.org/2000/01/rdf-schema#label |
Moore's algorithm
|
| gptkbp:input |
source vertex
weighted directed graph |
| gptkbp:namedAfter |
gptkb:Edward_F._Moore
|
| gptkbp:output |
shortest path distances from source
|
| gptkbp:relatedTo |
gptkb:Bellman–Ford_algorithm
|
| gptkbp:solvedBy |
gptkb:shortest_path_problem
|
| gptkbp:bfsParent |
gptkb:Edward_F._Moore
|
| gptkbp:bfsLayer |
5
|