Statements (23)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
gptkb:algorithm
|
| gptkbp:averageCaseComplexity |
O(E)
|
| gptkbp:canBe |
negative edge weights
|
| gptkbp:cannotHandle |
negative weight cycles
|
| gptkbp:category |
single-source shortest path algorithm
|
| gptkbp:complexity |
O(kE)
|
| gptkbp:field |
computer science
graph theory |
| gptkbp:fullName |
Shortest Path Faster Algorithm
|
| https://www.w3.org/2000/01/rdf-schema#label |
SPFA
|
| gptkbp:implementedIn |
queue-based
|
| gptkbp:improves |
gptkb:Bellman-Ford_algorithm
|
| gptkbp:input |
source vertex
weighted directed graph |
| gptkbp:output |
shortest path distances from source to all vertices
|
| gptkbp:proposedBy |
gptkb:Feng
|
| gptkbp:relatedTo |
gptkb:Bellman-Ford_algorithm
|
| gptkbp:usedFor |
finding shortest paths in a weighted graph
|
| gptkbp:worstCaseComplexity |
O(VE)
|
| gptkbp:yearProposed |
1994
|
| gptkbp:bfsParent |
gptkb:Scottish_Para-Football_Association
gptkb:Scottish_Professional_Footballers'_Association |
| gptkbp:bfsLayer |
7
|