首页| JavaScript| HTML/CSS| Matlab| PHP| Python| Java| C/C++/VC++| C#| ASP| 其他|
购买积分 购买会员 激活码充值

您现在的位置是:虫虫源码 > 其他 > procedures with the greedy algorithm to solve two hours coverage. Using greed cr...

procedures with the greedy algorithm to solve two hours coverage. Using greed cr...

  • 资源大小:2.25 kB
  • 上传时间:2021-06-30
  • 下载次数:0次
  • 浏览次数:0次
  • 资源积分:1积分
  • 标      签: Windows开发

资 源 简 介

该程序用贪心算法来求解二分覆盖问题. 采用贪婪准则:每次从A中选择一个顶点加入覆盖,选择时:选取能覆盖B中还未被覆盖的顶点的数目最多的顶点。-procedures with the greedy algorithm to solve two hours coverage. Using greed criteria : A time to choose from a peak accession coverage options : To B coverage can not be covered by the largest number of vertices of the vertex.

文 件 列 表

二分覆盖问题.cpp
VIP VIP
0.287249s