论文部分内容阅读
The problem of finding the minimum spanning tree(MST)is one of the most studied and important combinatorial optimisation problems in graph theory.Several types of uncertainties exist in real-life problems,which make it very hard to find the exact length o