Triple
T36199040
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | Prim's minimum spanning tree algorithm |
E1047207
|
entity |
| Predicate | coreIdea |
P533
|
FINISHED |
| Object | grow a tree by repeatedly adding the cheapest edge from the tree to a new vertex |
—
|
LITERAL FINISHED |
Provenance (2 batches)
| Stage | Batch ID | Job type | Status |
|---|---|---|---|
| creating | batch_69f76e414bdc8190996f15a544220a3d |
elicitation | completed |
| NER | batch_69f7b534d7b081909a0a382d3a52a230 |
ner | completed |
Created at: May 3, 2026, 4:08 p.m.