(a) Show that any tree with n > 1 nodes has an even number of odd-degree
nodes.
(c) Given a tree T that has m odd-degree nodes and m even-degree nodes,
determine the minimum number of edges to be added into T such that Eulerian
cycles exist in the resulting graph.
(d) Assume a cost c(i, j) is assigned to each pair of nodes vi and vj. Repeat
question (c), but now we want to minimize the total cost of newly added
edges. Design an algorithm to achieve the least-cost insertion.
這幾題不知如何下手 請大家幫忙討論一下 謝謝~
--
※ 發信站: 批踢踢實業坊(ptt.cc)
◆ From: 140.116.142.13