山东大学算法导论实验

上传者: chongtian123 | 上传时间: 2019-12-21 19:34:16 | 文件大小: 3.08MB | 文件类型: rar
实验5.生成一个100个点,300条边的无向图,对于图中的每个连通分支,计算其中的割点。从连通分支中删除该点,会导致分支不再连通的点被称为割点。 实验6.用局部搜索算法,求一个无向图的最小生成树。生成一个无向连通图,有100个点,1000条边,边上的权重是1到20之间的随机整数。用Kruskal或prim算法求得该图的最小生成树,验证局部搜索算法的对错。 实验7.已知Bellman-Ford算法能判断一个有向加权图是否含有负权重的圈。请设计一个算法,从图中找出一个负圈。图:100个点,500条边,每条边的权重是[-5,5]之间的随机非零整数。要求多次生成这样的随即图,直到发现负圈为止。

文件下载

资源详情

[{"title":"( 30 个子文件 3.08MB ) 山东大学算法导论实验","children":[{"title":"final5-7","children":[{"title":"shiyan","children":[{"title":"Debug","children":[{"title":"shiyan.ilk <span style='color:#111;'> 515.34KB </span>","children":null,"spread":false},{"title":"shiyan.pdb <span style='color:#111;'> 676.00KB </span>","children":null,"spread":false},{"title":"shiyan.exe <span style='color:#111;'> 121.50KB </span>","children":null,"spread":false}],"spread":true},{"title":".vs","children":[{"title":"shiyan","children":[{"title":"v15","children":[{"title":"ipch","children":[{"title":"62161f4bd8a61e00.ipch <span style='color:#111;'> 3.44MB </span>","children":null,"spread":false},{"title":"78b2665008264ddf.ipch <span style='color:#111;'> 3.44MB </span>","children":null,"spread":false}],"spread":true},{"title":".suo <span style='color:#111;'> 37.50KB </span>","children":null,"spread":false},{"title":"Browse.VC.db <span style='color:#111;'> 5.57MB </span>","children":null,"spread":false}],"spread":true}],"spread":true}],"spread":true},{"title":"shiyan","children":[{"title":"No_Dirction_Graph.h <span style='color:#111;'> 11.19KB </span>","children":null,"spread":false},{"title":"shiyan.cpp <span style='color:#111;'> 536B </span>","children":null,"spread":false},{"title":"Debug","children":[{"title":"shiyan.tlog","children":[{"title":"CL.read.1.tlog <span style='color:#111;'> 21.03KB </span>","children":null,"spread":false},{"title":"link.read.1.tlog <span style='color:#111;'> 3.94KB </span>","children":null,"spread":false},{"title":"link.write.1.tlog <span style='color:#111;'> 490B </span>","children":null,"spread":false},{"title":"CL.write.1.tlog <span style='color:#111;'> 928B </span>","children":null,"spread":false},{"title":"link.command.1.tlog <span style='color:#111;'> 2.38KB </span>","children":null,"spread":false},{"title":"shiyan.lastbuildstate <span style='color:#111;'> 217B </span>","children":null,"spread":false},{"title":"CL.command.1.tlog <span style='color:#111;'> 2.87KB </span>","children":null,"spread":false}],"spread":true},{"title":"vc141.pdb <span style='color:#111;'> 516.00KB </span>","children":null,"spread":false},{"title":"shiyan.log <span style='color:#111;'> 177B </span>","children":null,"spread":false},{"title":"vc141.idb <span style='color:#111;'> 499.00KB </span>","children":null,"spread":false},{"title":"shiyan.pch <span style='color:#111;'> 3.19MB </span>","children":null,"spread":false},{"title":"shiyan.obj <span style='color:#111;'> 407.91KB </span>","children":null,"spread":false},{"title":"stdafx.obj <span style='color:#111;'> 12.16KB </span>","children":null,"spread":false}],"spread":true},{"title":"stdafx.h <span style='color:#111;'> 284B </span>","children":null,"spread":false},{"title":"shiyan.vcxproj.filters <span style='color:#111;'> 1.47KB </span>","children":null,"spread":false},{"title":"ReadMe.txt <span style='color:#111;'> 1.48KB </span>","children":null,"spread":false},{"title":"shiyan.vcxproj <span style='color:#111;'> 7.99KB </span>","children":null,"spread":false},{"title":"stdafx.cpp <span style='color:#111;'> 279B </span>","children":null,"spread":false},{"title":"targetver.h <span style='color:#111;'> 296B </span>","children":null,"spread":false},{"title":"Dirction_Graph.h <span style='color:#111;'> 2.97KB </span>","children":null,"spread":false}],"spread":true},{"title":"shiyan.sln <span style='color:#111;'> 1.40KB </span>","children":null,"spread":false}],"spread":true}],"spread":true}],"spread":true}]

评论信息

免责申明

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