Triple
T34302659
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | Bellman–Ford algorithm |
E880220
|
entity |
| Predicate | usedAsSubroutineIn |
P196434
|
FINISHED |
| Object | Johnson's algorithm for all-pairs shortest paths |
—
|
LITERAL FINISHED |
Provenance (4 batches)
| Stage | Batch ID | Job type | Status |
|---|---|---|---|
| creating | batch_69f349b79f6c81909cb468c92c39c74d |
elicitation | completed |
| NER | batch_69fe349879848190bcd77e3cc3470458 |
ner | completed |
| PD | batch_69fe31e3cf908190b23ebc2f7fe58722 |
pd | completed |
| PDg | batch_69fe349739cc8190a21c408208312e6c |
pdg | completed |
Created at: May 1, 2026, 1:57 a.m.