2012 东三省数学建模D题 第一问 基于贪心算法下的自己画8种不同的打孔点并找点之间最小成本连线的GUI程序-2012 Manchuria D problem of mathematical modeling the first question based on the greedy algorithm, painted himself eight different punch point and find the minimum cost connection between GUI p