14 Nov
2002
14 Nov
'02
3:16 p.m.
Can DFS be used to detect cycles in an undirected graph? Using the code in the example file_dependencies.cpp on an undirected graph - it detects cycles even though there is none. Do we have to do more than simply look for back edges for an undirected graph? or should I convert it to directed then use this function? Thanks, Matt -- Matthew Galati ISE Lehigh University IBM Service Parts Solutions 610.758.4042 (Office) 610.882.0779 (Home) magh@lehigh.edu, magal11@us.ibm.com http://sagan.ie.lehigh.edu/mgalati/