minimum labeling spanning tree
常見例句
- The minimum labeling spanning tree(MLST) problem is an NP-hard problem in which, given a graph with labeled edges, one seeks a spanning tree with the least number of labels.
最小標記生成樹就是其中之一，它的目標是給出一個邊上帶有顔色的圖，計算使用顔色種類最少的生成樹。 返回 minimum labeling spanning tree