登录
首页 » Windows开发 » 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...

于 2022-07-17 发布 文件大小:2.25 kB
0 83
下载积分: 2 下载次数: 1

代码说明:

该程序用贪心算法来求解二分覆盖问题. 采用贪婪准则:每次从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.

下载说明:请别用迅雷下载,失败请重下,重下不扣分!

发表评论

0 个回复

  • 696518资源总数
  • 104349会员总数
  • 32今日下载