英语翻译设图G有n个结点,以下算法产生的是最小生成树：a) 选取最小权边e1,置边数i=1,b) i=n-1结束,否则转c）,c) 设已选择边为e1,e2,...ei,在G中选取不同与e1,e2,...ei的边ei+1,使｛e1,e2,...ei,ei+1｝中无

英语翻译设图G有n个结点,以下算法产生的是最小生成树：a) 选取最小权边e1,置边数i=1,b) i=n-1结束,否则转c）,c) 设已选择边为e1,e2,...ei,在G中选取不同与e1,e2,...ei的边ei+1,使｛e1,e2,...ei,ei+1｝中无
英语翻译
设图G有n个结点,以下算法产生的是最小生成树：
a) 选取最小权边e1,置边数i=1,
b) i=n-1结束,否则转c）,
c) 设已选择边为e1,e2,...ei,在G中选取不同与e1,e2,...ei的边ei+1,使｛e1,e2,...ei,ei+1｝中无回路且ei+1是满足此条件的最小边,
d) i=i+1,转b) .
利用Kruskal算法的原理,将各省的省会看作结点；直辖市也看作结点,以城市间的距离为边的权,将调度问题化为图论中类似与最小树的问题.
我们边的选择做以下约定：
城市之间的边（两个城市相连接）：两个城市之中,必须要有一个是缺水城市.若缺水城市和供水城市之间相连,这表示该缺水城市由该供水城市供水,若缺水城市和缺水城市相连接,这表示这两个城市可以看作一个城市,当一个城市获得供水的时候,另一个城市也能获得供水.
基于Kruskal算法,我们现在水调度的算法：
a) 记录缺水城市数为n;
b) 选取最小权边e1,置边数i=1,(权为城市见的距离)
c) 缺i=n-1,结束,否则转d）;
d) 设已选择边为e1,e2,...ei,在调度图中选取不同于e1,e2,...ei的边ei+1,使｛e1,e2,...ei,ei+1｝中无回路且ei+1是满足此条件的最小边,
e) i=i+1,转c)
供水城市的选择：
供水城市的选择主要就两方面,一是在富水地区选择,保证对缺水城市的供水,二是就近原则,供水城市应靠近缺水地区,可以多选几个作为备选,但明显远的供水城市应该舍弃.
选择的供水城市有：青海、陕西、安徽、浙江、辽宁

英语翻译设图G有n个结点,以下算法产生的是最小生成树：a) 选取最小权边e1,置边数i=1,b) i=n-1结束,否则转c）,c) 设已选择边为e1,e2,...ei,在G中选取不同与e1,e2,...ei的边ei+1,使｛e1,e2,...ei,ei+1｝中无
A graph G has n nodes, the following algorithm produces is the minimum spanning tree: a) select the minimum right side e1, buy edge number I = 1, b) I = n - 1 end, or turn c), c) have already selected edges for e1 and e2,... Ei, select the different in G and e1 and e2,... Ei edge ei + 1, {e1 and e2,... Ei, ei + 1} no loop and ei + 1 is to meet the conditions of the minimum edge, d) I = I + 1, turn b). Use Kruskal algorithm principle, the capital of the provinces as node; Municipalities also as node, with the distance between the cities for side of the right, the scheduling problem into a graph theory and similar minimum spanning tree problem. We choose to do the edge of the following agreement: the city between edge (two cities connected) : two cities in, must have a water shortage city. If the city water shortage and water supply between city linked together, this means that the water shortage city water supply by the urban water supply, water shortage and water shortage city city if connected, which means that the two cities can be viewed as a city, as a city for water supply, another city can also get water supply. Based on the Kruskal algorithm, we now water scheduling algorithm: a) record number of city water shortage for n; B) select the minimum right side e1, buy edge number I = 1, (right for city seen distance) c) lack of I = n - 1, close, or turn d); D) a selected edge for e1 and e2,... Ei, select the operation chart in different from e1 and e2,... Ei edge ei + 1, {e1 and e2,... Ei, ei + 1} no loop and ei + 1 is to meet the conditions of the minimum edge, e) I = I + 1, turn c) water city choice: the choice of city water supply mainly two aspects, one is rich in water area selection, to ensure that the water shortage city water supply, and the second is principle nearby, the water supply should be close to the city water area, can choose a few as alternative, but obviously far water city should give up. Choice of city water supply, qinghai, shaanxi, anhui, zhejiang, liaoning
纯手打,我打了半个小时.求求你了 !选为满意回答吧!
谢谢!望采纳!祝你学习快乐!