Description: （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.
To Search:
File list (Check if you may need any files):
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
Download