On Apr 4, 2006, at 6:17 PM, James Edward G. II wrote:
The above line has an error in it. Since I am creating one-way
paths here the assertion should be:assert_equal(count - i, … )
Actually, I was right the first time. The graph is a simple one-way
path so the longest simple route is a straight line walking all of
the edges and it includes all of the nodes.
You can tell how little I know about directed graph theory! 
James Edward G. II