[问答题]
The weights of the edges o
0+e f9 w2synh+g+1t zdfc nos.f a
tndvygghzi6 jzsd-*0(iqg. 3j 10h6 v graph $\boldsymbol{H}$ are given in the following table.
1. (1) Draw the weighted graph $\boldsymbol{H}$ on the vertices below.
(2) Using Kruskal's algorithm, find a minimum spanning tree for $\boldsymbol{H}$ . Clearly indicate the order in which the edges are added to the tree.
(3) Write down the weight of the minimum spanning tree.
Consider the following weighted graph $\boldsymbol{J}$ .
2. (1) Find a solution to the Chinese postman problem for the graph $\boldsymbol{J}$ .
(2) Write down the total weight of the solution.
3. (1) State the travelling salesman problem.
(2) Explain why there is no solution to the travelling salesman problem for the graph $\boldsymbol{J}$ .
