Triple
T13507194
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | Fibonacci heap |
E321043
|
entity |
| Predicate | usedInAlgorithm |
P25490
|
FINISHED |
| Object |
Prim's minimum spanning tree algorithm
Prim's minimum spanning tree algorithm is a greedy graph algorithm that incrementally builds a minimum-cost spanning tree by repeatedly adding the cheapest edge connecting the growing tree to a new vertex.
|
E1047207
|
NE FINISHED |
Provenance (5 batches)
| Stage | Batch ID | Job type | Status |
|---|---|---|---|
| creating | batch_69d807629d6c8190998f1b9bb12d2ed0 |
elicitation | completed |
| NER | batch_69dbbe99ddc08190a8d79107c8e176fa |
ner | completed |
| NED1 | batch_69f75d9009688190b8f18bb3525c6afd |
ned_source_triple | completed |
| NED2 | batch_69f75f4a3b0c81908c0ca0351771953b |
ned_description | completed |
| NEDg | batch_69f75ec5101081909652b0c0998b36c8 |
nedg | completed |
Created at: April 9, 2026, 9:43 p.m.