3-18有向树k值

(A set F that consists of the k vertices of the tree T is required to minimize the value of the cost (F) = min w (x) *d (x, U). In general, a directed tree is a multi tree, in order to facilitate the calculation, we put the tree change become the equivalent of two binary tree, the first son of each vertex in the left vertex vertex of the son of her father, additional vertex and add a 0 right side for 0 the right son vertex. Then the left son's vertex in the same way is added to the other son points in the same way, and continues until all the vertices are finished. The two forked tree has the same minimum cost as the tree T.)

3-18有向树k值
3-18有向树k值\Debug
3-18有向树k值\Debug\kmt2.exe, 229450, 2017-11-26
3-18有向树k值\Debug\kmt2.ilk, 264076, 2017-11-26
3-18有向树k值\Debug\kmt2.obj, 15847, 2017-11-26
3-18有向树k值\Debug\kmt2.pch, 307988, 2017-11-26
3-18有向树k值\Debug\kmt2.pdb, 451584, 2017-11-26
3-18有向树k值\Debug\vc60.idb, 50176, 2017-11-30
3-18有向树k值\Debug\vc60.pdb, 61440, 2017-11-26
3-18有向树k值\input.txt, 35, 2017-11-26
3-18有向树k值\kmt2.cpp, 2510, 2017-11-26
3-18有向树k值\kmt2.dsp, 3377, 2017-11-26
3-18有向树k值\kmt2.dsw, 516, 2017-11-26
3-18有向树k值\kmt2.ncb, 41984, 2017-11-30
3-18有向树k值\kmt2.opt, 48640, 2017-11-30
3-18有向树k值\kmt2.plg, 738, 2017-11-26
3-18有向树k值\output.txt, 3, 2017-11-30