Assertion list for term "find minimal spanning tree".
Results from Ascent++: 1
greedy algorithm (subgroup of algorithm) → CapableOf → find minimal spanning tree 0.81