assumesEdgeWeights
P184758
predicate
Indicates that a method, algorithm, or process operates under the assumption that the edges in a graph have associated weights that influence its behavior or results.
Observed surface forms (1)
| Surface form | Occurrences |
|---|---|
| requiresEdgeWeightsToBe | 1 |
Sample triples (2)
| Subject | Object |
|---|---|
| Bellman–Ford algorithm | finite via predicate surface "requiresEdgeWeightsToBe" ⓘ |
| Dijkstra's shortest path algorithm | non-negative ⓘ |