Re: Finding longest path between two vertices

On Fri, 15 Jun 2007 10:29:13 +0200, Robby Goetschalckx wrote:


After transforming to 1/w, the first path has a new weight of 0.5, and
the second a weight of 0.5 + 0.5, so according to your assumption the
first path in the original graph should be longer ...

Do you see any problems with my suggestion of negating the edge weights
and than search the shortest path?

Tim

.

Relevant Pages

  • Re: Finding longest path between two vertices
    ... Thanks for the correction and sorry for posting wrong information. ... one consisting of a single edge with weight 2 ... both with weight 2 ... After transforming to 1/w, the first path has a new weight of 0.5, ...
    (comp.theory)
  • Re: Finding longest path between two vertices
    ... one consisting of a single edge with weight 2 ... one consisting of two edges, both with weight 2 ... After transforming to 1/w, the first path has a new weight of 0.5, and the second a weight of 0.5 + 0.5, so according to your assumption the first path in the original graph should be longer ... ...
    (comp.theory)