摘要
本文依據某縣的公路網示意圖，求解不同條件下的災情巡視路線，1為定組巡視，2位限時巡視，並總結出1些在這類圖中求最優迴路的有效法則。文中首先將縣城公路示意圖轉化為賦權連通圖，並通過最小生成樹將原權圖分為若干子圖，分析並給出在這些子圖中尋找最佳迴路的.若干原則：擴環策略、增環策略、換枝策略，依據這些原則，求得不同條件下的巡視路線。
當巡視人員分為3組時，在要求總路線最短且儘可能均衡的條件下各組巡視路線分別為：159.3km，239.8km，186.4km。當要求在24小時完成巡視，各鄉（鎮）停留時間為2小時，各村停留時間為1小時時，至少需要分為4組，巡視完成時間為：22.4小時。
分析T，t和V的改變對最佳路線的影響不但於T，t和V的改變方式有關，而且與最佳路線均衡度的精度要求有關。
關鍵詞：最優方法；最小生成樹；連通圖；Kruskal演算法
ABSTRACT
On the basis of highway sketch map in a county, In this paper, the author tries to find out catastrophic scouting routes on different conditions. One is scouting in settled groups, the other is scouting in fixed time. And also summarizes effective principles about the most favorable circuit in this category of charts. The county highway sketch maps was transformed into value-endowed connected charts firstly, and divided the original value maps into several child charts through Minimum Cost Spanning Tree. By analyzing these child charts, several principles of the best circuit was found out, which was expanding strategy, circle strategy, branch-exchange. And on the basis of these strategies, scouting routes on different occasions was tried to find out.
Under the situation of dividing the scouting personnel into 3 groups, the shortest total route and as equilibrium as possible, each group of scouting route respectively is: 159.3km, 239.8km, 186.4km. If it was required to be finished scouting within 24 hours, they can be stayed at each county for about two hours and one hour in each village. The whole personnel must be divided into at least 4 groups and thus the required finishing time is: 22.4 hours.
The changes of T, t, V influence the most favorable route in the following ways: the relationship between T, t, V and the most favorable route is: it is not only related with the changing way of T, t and V, but also related with the precision requirement of the most favorable routes equilibrium.
Keywords： the best favorable method；Minimum Cost Spanning Tree；Connected chart；Kruskal arithmetic