文件名称:GraphDis
- 所属分类：
- 图形图像处理(光照,映射..)
- 资源属性：
- [Windows] [Visual.Net] [源码]
- 上传时间：
- 2012-11-26
- 文件大小：
- 1.14mb
- 下载次数：
- 0次
- 提 供 者：
- xjt****
- 相关连接：
- 无
- 下载说明：
- 别用迅雷下载，失败请重下，重下不扣分！
介绍说明－－下载内容均来自于网络，请自行研究使用
两个图算法
完整工程
1、实现O(n + r)时间复杂度内，good guy和bad guy的匹配
2、在无环图中，寻找两点之间的路径数目-（1）There are two types of professional wrestlers: "good guys" and "bad guys." Between any pair of professional wrestlers,
there may or may not be a rivalry. Suppose we have n professional wrestlers and we have a list of r pairs of wrestlers
for which there are rivalries. Give an O(n+ r)-time algorithm that determines whether it is possible to designate some
of the wrestlers as good guys and the remainder as bad guys such that each rivalry is between a good guy and a bad guy.
If is it possible to perform such a designation, your algorithm should produce it.
（2）Write a program that takes as input a directed acyclic graph G = (V, E) and two vertices s and t,
and returns the number of paths from s to t in G.
完整工程
1、实现O(n + r)时间复杂度内，good guy和bad guy的匹配
2、在无环图中，寻找两点之间的路径数目-（1）There are two types of professional wrestlers: "good guys" and "bad guys." Between any pair of professional wrestlers,
there may or may not be a rivalry. Suppose we have n professional wrestlers and we have a list of r pairs of wrestlers
for which there are rivalries. Give an O(n+ r)-time algorithm that determines whether it is possible to designate some
of the wrestlers as good guys and the remainder as bad guys such that each rivalry is between a good guy and a bad guy.
If is it possible to perform such a designation, your algorithm should produce it.
（2）Write a program that takes as input a directed acyclic graph G = (V, E) and two vertices s and t,
and returns the number of paths from s to t in G.
(系统自动生成,下载前可以参看下载内容)
下载文件列表
GraphDis\Debug\GraphDis.exe
........\.....\GraphDis.ilk
........\.....\GraphDis.pdb
........\GraphDis\BaseStructs.h
........\........\Constant.h
........\........\Debug\BuildLog.htm
........\........\.....\Graph.obj
........\........\.....\GraphDis.exe.intermediate.manifest
........\........\.....\mt.dep
........\........\.....\Test.obj
........\........\.....\vc90.idb
........\........\.....\vc90.pdb
........\........\Graph.cpp
........\........\Graph.h
........\........\graph.txt
........\........\GraphDis.vcproj
........\........\GraphDis.vcproj.acer-PC.Administrator.user
........\........\readme.txt
........\........\Release\BuildLog.htm
........\........\.......\Graph.obj
........\........\.......\GraphDis.exe.intermediate.manifest
........\........\.......\mt.dep
........\........\.......\Test.obj
........\........\.......\vc90.idb
........\........\.......\vc90.pdb
........\........\Test.cpp
........\GraphDis.ncb
........\GraphDis.sln
........\GraphDis.suo
........\Release\GraphDis.exe
........\.......\GraphDis.pdb
........\GraphDis\Debug
........\........\Release
........\Debug
........\GraphDis
........\Release
GraphDis
........\.....\GraphDis.ilk
........\.....\GraphDis.pdb
........\GraphDis\BaseStructs.h
........\........\Constant.h
........\........\Debug\BuildLog.htm
........\........\.....\Graph.obj
........\........\.....\GraphDis.exe.intermediate.manifest
........\........\.....\mt.dep
........\........\.....\Test.obj
........\........\.....\vc90.idb
........\........\.....\vc90.pdb
........\........\Graph.cpp
........\........\Graph.h
........\........\graph.txt
........\........\GraphDis.vcproj
........\........\GraphDis.vcproj.acer-PC.Administrator.user
........\........\readme.txt
........\........\Release\BuildLog.htm
........\........\.......\Graph.obj
........\........\.......\GraphDis.exe.intermediate.manifest
........\........\.......\mt.dep
........\........\.......\Test.obj
........\........\.......\vc90.idb
........\........\.......\vc90.pdb
........\........\Test.cpp
........\GraphDis.ncb
........\GraphDis.sln
........\GraphDis.suo
........\Release\GraphDis.exe
........\.......\GraphDis.pdb
........\GraphDis\Debug
........\........\Release
........\Debug
........\GraphDis
........\Release
GraphDis