文件名称:030300545bicov.cpp
介绍说明－－下载内容均来自于网络，请自行研究使用
对于图G=(V,E)，如果边集合C包含于E 使得对于任意的v∈V，都关联于C 中的一条边，则称C 为图G的一个覆盖。图G的边数最少的覆盖称为G 的最小覆盖。
- Regarding attempts G= (V, E), if gathers C to contain causes
free regarding to E v 鈭?V, all is connected Yu Czhong nearby, then
called C is attempts G a cover. Attempts G the side number least
covers to be called G the smallest cover.
- Regarding attempts G= (V, E), if gathers C to contain causes
free regarding to E v 鈭?V, all is connected Yu Czhong nearby, then
called C is attempts G a cover. Attempts G the side number least
covers to be called G the smallest cover.
(系统自动生成,下载前可以参看下载内容)
下载文件列表
压缩包 : 31767680030300545bicov.cpp.rar 列表