2 questions. first, why are you storing the direction? isn't that
implied in (V1,V2,dist)? (direction: V1->V2) unless you're storing each
edge twice for some caching purpose i'm not seeing?
second, by definition the longest path in a cyclic graph is infinitely
long. you need to convert it
seconded. (or thirded? :) the commute from dallas is rough.
Tim Wintle wrote:
I would certainly appreciate being able to watch them online too, and
they would help spread the word about hadoop - think of all the people
who watch Google's Techtalks (am I allowed to say the "G" word around
here
