Talk:Shortest path problem

From Wikipedia, the free encyclopedia

You have new messages (last change).

The algorithms doesn't really make clear what the shortest path actually is. Also, do we need f ≥ 0?

The algorithm given is not correct. For instance, if A is connected to B with cost 1 and B connected to C with cost 1 and A connected to C with cost 3, then the algorithm (for n = A and n' = C) will find the "shortest path" A-C with cost 3, even though A-B-C is shorter. AxelBoldt

Right you are :-( Next try JeLuF

Should there be "see also" here for Traveling salesman problem? David 10:48 Aug 9, 2002 (PDT)

The general definition at the top references a set of vertices V, but then chooses nodes n and n' from N. This is inconsistent.

Fixed. (204.50.113.28 22:34, 11 September 2006 (UTC))

Is the Spanish reference really appropriate on the English Wiki? I'm sure there are many decent English references available. 24.7.106.155 07:32, 9 May 2006 (UTC)

Retrieved from "http://en.wikipedia.org../../../s/h/o/Talk%7EShortest_path_problem_1b82.html"