文件名称:GraphDis
-
所属分类：
- 标签属性：
- 上传时间：2012-11-16
-
文件大小：1.14mb
-
已下载：0次
-
提 供 者：
-
相关连接：无下载说明：别用迅雷下载，失败请重下，重下不扣分！
介绍说明－－下载内容来自于网络，使用问题请自行百度
两个图算法
完整工程
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/Debug/GraphDis.ilk
GraphDis/Debug/GraphDis.pdb
GraphDis/GraphDis/BaseStructs.h
GraphDis/GraphDis/Constant.h
GraphDis/GraphDis/Debug/BuildLog.htm
GraphDis/GraphDis/Debug/Graph.obj
GraphDis/GraphDis/Debug/GraphDis.exe.intermediate.manifest
GraphDis/GraphDis/Debug/mt.dep
GraphDis/GraphDis/Debug/Test.obj
GraphDis/GraphDis/Debug/vc90.idb
GraphDis/GraphDis/Debug/vc90.pdb
GraphDis/GraphDis/Graph.cpp
GraphDis/GraphDis/Graph.h
GraphDis/GraphDis/graph.txt
GraphDis/GraphDis/GraphDis.vcproj
GraphDis/GraphDis/GraphDis.vcproj.acer-PC.Administrator.user
GraphDis/GraphDis/readme.txt
GraphDis/GraphDis/Release/BuildLog.htm
GraphDis/GraphDis/Release/Graph.obj
GraphDis/GraphDis/Release/GraphDis.exe.intermediate.manifest
GraphDis/GraphDis/Release/mt.dep
GraphDis/GraphDis/Release/Test.obj
GraphDis/GraphDis/Release/vc90.idb
GraphDis/GraphDis/Release/vc90.pdb
GraphDis/GraphDis/Test.cpp
GraphDis/GraphDis.ncb
GraphDis/GraphDis.sln
GraphDis/GraphDis.suo
GraphDis/Release/GraphDis.exe
GraphDis/Release/GraphDis.pdb
GraphDis/GraphDis/Debug
GraphDis/GraphDis/Release
GraphDis/Debug
GraphDis/GraphDis
GraphDis/Release
GraphDis
GraphDis/Debug/GraphDis.ilk
GraphDis/Debug/GraphDis.pdb
GraphDis/GraphDis/BaseStructs.h
GraphDis/GraphDis/Constant.h
GraphDis/GraphDis/Debug/BuildLog.htm
GraphDis/GraphDis/Debug/Graph.obj
GraphDis/GraphDis/Debug/GraphDis.exe.intermediate.manifest
GraphDis/GraphDis/Debug/mt.dep
GraphDis/GraphDis/Debug/Test.obj
GraphDis/GraphDis/Debug/vc90.idb
GraphDis/GraphDis/Debug/vc90.pdb
GraphDis/GraphDis/Graph.cpp
GraphDis/GraphDis/Graph.h
GraphDis/GraphDis/graph.txt
GraphDis/GraphDis/GraphDis.vcproj
GraphDis/GraphDis/GraphDis.vcproj.acer-PC.Administrator.user
GraphDis/GraphDis/readme.txt
GraphDis/GraphDis/Release/BuildLog.htm
GraphDis/GraphDis/Release/Graph.obj
GraphDis/GraphDis/Release/GraphDis.exe.intermediate.manifest
GraphDis/GraphDis/Release/mt.dep
GraphDis/GraphDis/Release/Test.obj
GraphDis/GraphDis/Release/vc90.idb
GraphDis/GraphDis/Release/vc90.pdb
GraphDis/GraphDis/Test.cpp
GraphDis/GraphDis.ncb
GraphDis/GraphDis.sln
GraphDis/GraphDis.suo
GraphDis/Release/GraphDis.exe
GraphDis/Release/GraphDis.pdb
GraphDis/GraphDis/Debug
GraphDis/GraphDis/Release
GraphDis/Debug
GraphDis/GraphDis
GraphDis/Release
GraphDis
本网站为编程资源及源代码搜集、介绍的搜索网站，版权归原作者所有！ 粤ICP备11031372号
1999-2046 搜珍网 All Rights Reserved.