Triple
T14773379
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | Robert W. Floyd |
E347190
|
entity |
| Predicate | notableWork |
P4
|
FINISHED |
| Object |
Floyd–Warshall algorithm
The Floyd–Warshall algorithm is a classic dynamic programming method in computer science for efficiently computing shortest paths between all pairs of vertices in a weighted graph, even when negative edge weights are present.
|
E1119493
|
NE FINISHED |
Provenance (5 batches)
| Stage | Batch ID | Job type | Status |
|---|---|---|---|
| creating | batch_69d822e9b9e08190bedcc31a163fda82 |
elicitation | completed |
| NER | batch_69dec81485e08190be35baafcf22b6f2 |
ner | completed |
| NED1 | batch_69fe0cfd26fc81909fba39c8705437ed |
ned_source_triple | completed |
| NED2 | batch_69fe18786294819080ce5ee0d8af00c9 |
ned_description | completed |
| NEDg | batch_69fe17fc37ec8190b2e9c786a5e7843e |
nedg | completed |
Created at: April 10, 2026, 1:31 a.m.