文件名称:bicov.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.
(系统自动生成,下载前可以参看下载内容)
下载文件列表
1999-2046 搜珍网 All Rights Reserved.
本站作为网络服务提供者，仅为网络服务对象提供信息存储空间，仅对用户上载内容的表现方式做保护处理，对上载内容本身不做任何修改或编辑。