"jackyy 写道：
"
> So you mean my friend's algorithm works? As the modified graph can find
> the shotest path 1->3 instead of 1->2->3.
No, Atamyrat Hezretguliyew means that doesn't work. As the edge's
number along the path also influence the choice of edge. I mean, the
shortest-path should be deter
So you mean my friend's algorithm works? As the modified graph can find
the shotest path 1->3 instead of 1->2->3.
jackyy
Atamyrat Hezretguliyew 寫道：
> On 12/6/06, jackyy <[EMAIL PROTECTED]> wrote:
> >
> > My friend has the following idea to get an algorithm for finding a
> > shortest path tree o
On 12/6/06, jackyy <[EMAIL PROTECTED]> wrote:
>
> My friend has the following idea to get an algorithm for finding a
> shortest path tree on
> a graph whose edges may have negative length (but with no negative
> cycle):
>
> (i) Examine the edges and find the edge e with the most negative
> length.
