> > Finding a cycle in a graph has nothing to do with whether or not the
> > edges are weighted.  A cycle is a cycle, pure and simple.  Think about
> > it.
> > Email: Mark_Weaver@brown.edu           | Brown University
> 
> OK, I have.
> 
> Subtle changes in a problem can often make the difference between it
> being tractable or intractable.  The existence of edge weights can
> certainly make a significant difference.  
> 
> However, Mark is (mostly) correct in this instance.

I'm sorry, I was very tired when I said this (up for ~40 hours), and I
thought we were talking about finding ANY cycle, as opposed to the
longest one.  *blush*

	Mark
--------------------------------------------------------------------
Email: Mark_Weaver@brown.edu           | Brown University
PGP Key: finger mhw@cs.brown.edu       | Dept of Computer Science

------------------------------------------------------------------------------