本程序是采用Rational rose 2003做的UML案例额,是初学者不得多得的参考。会有助于学习Rational rose 2003-This procedure is done using Rational rose 2003 case of the amount of UML, a beginner can not get a reference number. Will help to learn Rational rose 2003
给出一个连通带权的无向图,找出该图的最小生成树。并带有问题的详细描述及测试数据。-Given a connected weighted undirected graph, find the minimum spanning tree graph. With a detailed description of the problem and the test data.