3-19有向树独立K

所属分类其他
开发工具:Visual C++
文件大小:692KB
下载次数:1
上传日期:2017-12-18 21:01:02
上 传 者为了
说明:  要求有向树T的k个独立顶点组成的集合F,使cost(F)=∑min w(x)*d(x,u)的值达到最小。与有向树k中值问题类似,把有向树变转成为与之等价的二叉树,设T的以顶点x为根的子树T(x),其左、右儿子顶点分别为y和z。
(A set F that consists of a k independent vertex to a tree T is required to minimize the value of the cost (F) = min w (x) *d (x, U). Similar to the K median problem of the directed tree, it transforms the directed tree into an equivalent two branch tree, and sets the subtree T (x) of T with vertex x as its root, whose left and right son vertices are y and Z, respectively.)

文件列表:[举报垃圾]
3-19有向树独立K
3-19有向树独立K\kzhongzhi
3-19有向树独立K\kzhongzhi\Debug
3-19有向树独立K\kzhongzhi\Debug\kzhongzhi.exe, 544823, 2017-11-26
3-19有向树独立K\kzhongzhi\Debug\kzhongzhi.ilk, 785320, 2017-11-26
3-19有向树独立K\kzhongzhi\Debug\kzhongzhi.obj, 243537, 2017-11-26
3-19有向树独立K\kzhongzhi\Debug\kzhongzhi.pch, 203680, 2017-11-26
3-19有向树独立K\kzhongzhi\Debug\kzhongzhi.pdb, 1090560, 2017-11-26
3-19有向树独立K\kzhongzhi\Debug\StdAfx.obj, 1786, 2017-11-26
3-19有向树独立K\kzhongzhi\Debug\vc60.idb, 66560, 2017-11-26
3-19有向树独立K\kzhongzhi\Debug\vc60.pdb, 118784, 2017-11-26
3-19有向树独立K\kzhongzhi\kzhongzhi.cpp, 2874, 2017-11-26
3-19有向树独立K\kzhongzhi\kzhongzhi.dsp, 4586, 2017-11-26
3-19有向树独立K\kzhongzhi\kzhongzhi.dsw, 524, 2017-11-26
3-19有向树独立K\kzhongzhi\kzhongzhi.ncb, 50176, 2017-11-30
3-19有向树独立K\kzhongzhi\kzhongzhi.opt, 48640, 2017-11-30
3-19有向树独立K\kzhongzhi\kzhongzhi.plg, 1670, 2017-11-26
3-19有向树独立K\kzhongzhi\ReadMe.txt, 1226, 2017-11-26
3-19有向树独立K\kzhongzhi\StdAfx.cpp, 296, 2017-11-26
3-19有向树独立K\kzhongzhi\StdAfx.h, 769, 2017-11-26

近期下载者

相关文件

评论我要评论

收藏者