Triple
T13507193
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | Fibonacci heap |
E321043
|
entity |
| Predicate | usedInAlgorithm |
P25490
|
FINISHED |
| Object |
Dijkstra's shortest path algorithm
Dijkstra's shortest path algorithm is a classic graph algorithm that efficiently computes the minimum-cost paths from a single source vertex to all other vertices in a weighted graph with non-negative edge weights.
|
E1045595
|
NE FINISHED |
Provenance (5 batches)
| Stage | Batch ID | Job type | Status |
|---|---|---|---|
| creating | batch_69d807629d6c8190998f1b9bb12d2ed0 |
elicitation | completed |
| NER | batch_69dbbe99ddc08190a8d79107c8e176fa |
ner | completed |
| NED1 | batch_69f7548e51b881909a3384812556bc3d |
ned_source_triple | completed |
| NED2 | batch_69f757e7322c8190b0e36e8373d42ac4 |
ned_description | completed |
| NEDg | batch_69f757108e088190aeec031eccc9aca3 |
nedg | completed |
Created at: April 9, 2026, 9:43 p.m.