zuixiaoquandingdianfugai
代码说明:
给定一个赋权无向图G=(V,E),每个定点v∈U都有一个权值w(v)。如果U V,且对任意(u,v)∈E有u∈U或v∈U,就称U为图G的一个定点覆盖。G的最小权顶点覆盖是指G中所含顶点权之和最小的顶点覆盖。(Empowering given a undirected graph G = (V, E), each point v ∈ U has a weight w (v). If the UV, and for any (u, v) ∈ E there is u ∈ U or v ∈ U, on U that map G to a fixed-point coverage. G the right to the minimum vertex cover is contained in G refers to the right vertex of the vertex cover and minimum.)
文件列表:
20060830113 宋溪 最小权顶点覆盖问题
...................................\zuixiaoquan.cpp
...................................\zuixiaoquan.exe
...................................\最小权顶点覆盖问题.doc
下载说明:请别用迅雷下载,失败请重下,重下不扣分!