greedy algorithm (subgroup of algorithm) → CapableOf → find minimal spanning tree
Typicality: 0.807
Saliency: 1.000
Facets 0
No facets.
Open triples 1
greedy algorithm → find → minimal spanning tree 4
Sentiment analysis
negative neutral positive
0.045 0.515 0.440
Other statistics
Raw frequency 4
Normalized frequency 1.000
Modifier score 0.900
Perplexity 91.525