首页 课程资源 专业指导     /    最大团问题(回溯法/分支限界法)

最大团问题(回溯法/分支限界法)

上传者: wiwinds | 上传时间:2023/8/28 8:12:35 | 文件大小:3.15MB | 文件类型:rar
最大团问题(回溯法/分支限界法)
问题描述图G=(V,E)的一个团是图G的一个完全子图,即该子图中任意两个相异的顶点都有一条边相连。
最大团问题就是要找出图G中顶点数最多的一个团。
基本要求(1)用回溯法来求解最大团问题。
(2)用分支限界法来求解最大团问题。
测试数据由读者给定若干连通图。
实现提示本课程设计的实现主要包括以下主要过程:(1)关于解的编码形式(对应顶点i的变量x[i]=1当且仅当顶点i属于找到的最大团)。
(2)设计合适的上界函数,即如何确定当前团最大顶点数的上界。

文件下载

资源详情

[{"title":"(76个子文件3.15MB)最大团问题(回溯法/分支限界法)","children":[{"title":"实验设计-MCP(回溯法)","children":[{"title":"实验设计-MCP(回溯法)","children":[{"title":"实验设计-MCP(回溯法).vcproj <span style='color:#111;'>3.70KB</span>","children":null,"spread":false},{"title":"data.txt <span style='color:#111;'>58B</span>","children":null,"spread":false},{"title":"实验设计-MCP(回溯法).vcproj.E305-115.user.user <span style='color:#111;'>1.38KB</span>","children":null,"spread":false},{"title":"实验设计-MCP(回溯法).vcproj.Moese-Wi.Moese.user <span style='color:#111;'>1.38KB</span>","children":null,"spread":false},{"title":"MCP(回溯法).cpp <span style='color:#111;'>1.64KB</span>","children":null,"spread":false},{"title":"data2.txt <span style='color:#111;'>56B</span>","children":null,"spread":false},{"title":"Debug","children":[{"title":"实验设计-MCP(回溯法).exe.intermediate.manifest <span style='color:#111;'>621B</span>","children":null,"spread":false},{"title":"BuildLog.htm <span style='color:#111;'>7.25KB</span>","children":null,"spread":false},{"title":"vc90.pdb <span style='color:#111;'>220.00KB</span>","children":null,"spread":false},{"title":"vc90.idb <span style='color:#111;'>299.00KB</span>","children":null,"spread":false},{"title":"mt.dep <span style='color:#111;'>67B</span>","children":null,"spread":false},{"title":"MCP(回溯法).obj <span style='color:#111;'>45.22KB</span>","children":null,"spread":false}],"spread":true},{"title":"data.png <span style='color:#111;'>24.48KB</span>","children":null,"spread":false}],"spread":true},{"title":"实验设计-MCP(回溯法).sln <span style='color:#111;'>947B</span>","children":null,"spread":false},{"title":"实验设计-MCP(回溯法).ncb <span style='color:#111;'>579.00KB</span>","children":null,"spread":false},{"title":"实验设计-MCP(回溯法).suo <span style='color:#111;'>15.00KB</span>","children":null,"spread":false},{"title":"Debug","children":[{"title":"实验设计-MCP(回溯法).ilk <span style='color:#111;'>378.34KB</span>","children":null,"spread":false},{"title":"实验设计-MCP(回溯法).pdb <span style='color:#111;'>531.00KB</span>","children":null,"spread":false},{"title":"实验设计-MCP(回溯法).exe <span style='color:#111;'>38.50KB</span>","children":null,"spread":false}],"spread":true}],"spread":true},{"title":"最大团问题研究(含报告、PPT及C++&Java算法源码)","children":[{"title":"实验设计-MCP(回溯法)","children":[{"title":"实验设计-MCP(回溯法)","children":[{"title":"实验设计-MCP(回溯法).vcproj <span style='color:#111;'>3.70KB</span>","children":null,"spread":false},{"title":"data.txt <span style='color:#111;'>58B</span>","children":null,"spread":false},{"title":"实验设计-MCP(回溯法).vcproj.Moese-Wi.Moese.user <span style='color:#111;'>1.38KB</span>","children":null,"spread":false},{"title":"MCP(回溯法).cpp <span style='color:#111;'>1.70KB</span>","children":null,"spread":false},{"title":"data2.txt <span style='color:#111;'>56B</span>","children":null,"spread":false},{"title":"Debug","children":[{"title":"实验设计-MCP(回溯法).exe.intermediate.manifest <span style='color:#111;'>621B</span>","children":null,"spread":false},{"title":"BuildLog.htm <span style='color:#111;'>7.25KB</span>","children":null,"spread":false},{"title":"vc90.pdb <span style='color:#111;'>220.00KB</span>","children":null,"spread":false},{"title":"vc90.idb <span style='color:#111;'>283.00KB</span>","children":null,"spread":false},{"title":"mt.dep <span style='color:#111;'>65B</span>","children":null,"spread":false},{"title":"MCP(回溯法).obj <span style='color:#111;'>45.37KB</span>","children":null,"spread":false}],"spread":true},{"title":"data.png <span style='color:#111;'>24.48KB</span>","children":null,"spread":false}],"spread":true},{"title":"实验设计-MCP(回溯法).sln <span style='color:#111;'>947B</span>","children":null,"spread":false},{"title":"实验设计-MCP(回溯法).ncb <span style='color:#111;'>1.15MB</span>","children":null,"spread":false},{"title":"实验设计-MCP(回溯法).suo <span style='color:#111;'>14.50KB</span>","children":null,"spread":false},{"title":"Debug","children":[{"title":"实验设计-MCP(回溯法).ilk <span style='color:#111;'>378.49KB</span>","children":null,"spread":false},{"title":"实验设计-MCP(回溯法).pdb <span style='color:#111;'>531.00KB</span>","children":null,"spread":false},{"title":"实验设计-MCP(回溯法).exe <span style='color:#111;'>38.50KB</span>","children":null,"spread":false}],"spread":true}],"spread":true},{"title":"最大团问题研究报告.doc <span style='color:#111;'>1.17MB</span>","children":null,"spread":false},{"title":"实验设计-MCP(分支限界法)","children":[{"title":"实验设计-MCP(分支限界法)","children":[{"title":"实验设计-MCP(分支限界法).vcproj.Moese-Wi.Moese.user <span style='color:#111;'>1.38KB</span>","children":null,"spread":false},{"title":"MCP(分支限界法).cpp <span style='color:#111;'>2.58KB</span>","children":null,"spread":false},{"title":"data.txt <span style='color:#111;'>58B</span>","children":null,"spread":false},{"title":"data2.txt <span style='color:#111;'>56B</span>","children":null,"spread":false},{"title":"实验设计-MCP(分支限界法).vcproj <span style='color:#111;'>3.71KB</span>","children":null,"spread":false},{"title":"Debug","children":[{"title":"BuildLog.htm <span style='color:#111;'>7.65KB</span>","children":null,"spread":false},{"title":"实验设计-MCP(分支限界法).exe.intermediate.manifest <span style='color:#111;'>621B</span>","children":null,"spread":false},{"title":"vc90.pdb <span style='color:#111;'>252.00KB</span>","children":null,"spread":false},{"title":"vc90.idb <span style='color:#111;'>323.00KB</span>","children":null,"spread":false},{"title":"mt.dep <span style='color:#111;'>65B</span>","children":null,"spread":false},{"title":"MCP(分支限界法).obj <span style='color:#111;'>256.92KB</span>","children":null,"spread":false}],"spread":true}],"spread":true},{"title":"实验设计-MCP(分支限界法).sln <span style='color:#111;'>965B</span>","children":null,"spread":false},{"title":"实验设计-MCP(分支限界法).ncb <span style='color:#111;'>1.42MB</span>","children":null,"spread":false},{"title":"实验设计-MCP(分支限界法).suo <span style='color:#111;'>15.50KB</span>","children":null,"spread":false},{"title":"Debug","children":[{"title":"实验设计-MCP(分支限界法).exe <span style='color:#111;'>77.50KB</span>","children":null,"spread":false},{"title":"实验设计-MCP(分支限界法).pdb <span style='color:#111;'>683.00KB</span>","children":null,"spread":false},{"title":"实验设计-MCP(分支限界法).ilk <span style='color:#111;'>489.12KB</span>","children":null,"spread":false}],"spread":true}],"spread":true},{"title":"最大团算法研究.ppt <span style='color:#111;'>1.21MB</span>","children":null,"spread":false},{"title":"082014.doc <span style='color:#111;'>921.50KB</span>","children":null,"spread":false},{"title":"data.png <span style='color:#111;'>21.20KB</span>","children":null,"spread":false}],"spread":true},{"title":"实验设计-MCP(分支限界法)","children":[{"title":"实验设计-MCP(分支限界法)","children":[{"title":"实验设计-MCP(分支限界法).vcproj.Moese-Wi.Moese.user <span style='color:#111;'>1.38KB</span>","children":null,"spread":false},{"title":"MCP(分支限界法).cpp <span style='color:#111;'>2.58KB</span>","children":null,"spread":false},{"title":"data.txt <span style='color:#111;'>58B</span>","children":null,"spread":false},{"title":"实验设计-MCP(分支限界法).vcproj.E305-115.user.user <span style='color:#111;'>1.38KB</span>","children":null,"spread":false},{"title":"data2.txt <span style='color:#111;'>56B</span>","children":null,"spread":false},{"title":"实验设计-MCP(分支限界法).vcproj <span style='color:#111;'>3.71KB</span>","children":null,"spread":false},{"title":"Debug","children":[{"title":"BuildLog.htm <span style='color:#111;'>7.65KB</span>","children":null,"spread":false},{"title":"实验设计-MCP(分支限界法).exe.intermediate.manifest <span style='color:#111;'>621B</span>","children":null,"spread":false},{"title":"vc90.pdb <span style='color:#111;'>252.00KB</span>","children":null,"spread":false},{"title":"vc90.idb <span style='color:#111;'>331.00KB</span>","children":null,"spread":false},{"title":"mt.dep <span style='color:#111;'>67B</span>","children":null,"spread":false},{"title":"MCP(分支限界法).obj <span style='color:#111;'>256.77KB</span>","children":null,"spread":false}],"spread":true}],"spread":true},{"title":"实验设计-MCP(分支限界法).sln <span style='color:#111;'>965B</span>","children":null,"spread":false},{"title":"实验设计-MCP(分支限界法).ncb <span style='color:#111;'>1.91MB</span>","children":null,"spread":false},{"title":"实验设计-MCP(分支限界法).suo <span style='color:#111;'>16.00KB</span>","children":null,"spread":false},{"title":"Debug","children":[{"title":"实验设计-MCP(分支限界法).exe <span style='color:#111;'>77.50KB</span>","children":null,"spread":false},{"title":"实验设计-MCP(分支限界法).pdb <span style='color:#111;'>683.00KB</span>","children":null,"spread":false},{"title":"实验设计-MCP(分支限界法).ilk <span style='color:#111;'>488.97KB</span>","children":null,"spread":false}],"spread":true}],"spread":true}],"spread":true}]

评论信息

  • 啊!!!:
    很好哈哈哈2018-12-11
  • wwwwmmmm1234:
    代码不错。。学习了!!!!!!!!2015-10-22
  • 小心头给你打烂:
    挺不错的,好用2015-07-09
  • csdnlty:
    课程设计内容和书上一样2014-06-02
  • wbs810:
    很好用的代码学习了2014-03-27

免责申明

【好快吧下载】的资源来自网友分享,仅供学习研究,请务必在下载后24小时内给予删除,不得用于其他任何用途,否则后果自负。基于互联网的特殊性,【好快吧下载】 无法对用户传输的作品、信息、内容的权属或合法性、合规性、真实性、科学性、完整权、有效性等进行实质审查;无论 【好快吧下载】 经营者是否已进行审查,用户均应自行承担因其传输的作品、信息、内容而可能或已经产生的侵权或权属纠纷等法律责任。
本站所有资源不代表本站的观点或立场,基于网友分享,根据中国法律《信息网络传播权保护条例》第二十二条之规定,若资源存在侵权或相关问题请联系本站客服人员,8686821#qq.com,请把#换成@,本站将给予最大的支持与配合,做到及时反馈和处理。关于更多版权及免责申明参见 版权及免责申明