A route 6, C, D, E, long distance 5 + 3 + 3 = 11 km.Route 7 A, C, D, F, E, long distance 5 + 3 + 2 + 2 = 12 kilometers.It can be seen that route 1 A, B, D, E, distance 6 km is the shortest distances.It can be seen that A, B, D, E is the shortest trajectory. For the weighted graph with vertices, lines, welding a lot. To find the trajectory A – Z as short as possible.By searching the A – Z of all the trajectories, and then select the shortest trajectory that includes the effects of minimal weight. Do not lose time and conveniently find A – Z as short as possible. Definitions From A to Z vertex vertex in weighted graphs is A trajectory-Z that the sum of the weight of all the lines in A ragged line – Z minimum. From the definition that the shortest trajectory is a sum of the value of the weight of the horizontal lines (trajectories) has minimal value. 2.1.4 minimum radiated around the tree. Definitions The trees radiating around to the smallest (the minimal spanning tree) is a tree that has radiated throughout the sum of weight values of individual lines, minimal. From the definition The trees radiating around to the smallest by total weight of each line in the trees radiating around that have minimal value. To select a minimal path from the graph associated with a weight to produce a graph contact believes that ant by selecting the graph line weight not more than n-1 times when the graph has n points points and the selection must not cause this cycle will be terminated when the trees radiating all around and tons of wood, we call sprawl across with the sum of the weight of the smallest lines that radiate around the tree at minimum (minimal spanning tree).
การแปล กรุณารอสักครู่..
![](//thimg.ilovetranslation.com/pic/loading_3.gif?v=b9814dd30c1d7c59_8619)