Reply to thread

Message

[QUOTE="JSH, post: 3614139"]
I was a professional Java developer.  I also have the open source
project Class Viewer for Java.

I am curious though, have you heard of it?

If not, Google Class Viewer with or without quotes.  You can even us
the "Get Lucky" feature.

I have an open source project at Google Code called optimalpathengine
which brings things back full circle in an interesting round-trip path
(little TSP humor).

I haven't even started design yet.

Besides, the algorithm can be tested with the Euclidean TSP by
checking the distance between nodes from the outside in, as I
explained in other replies in this thread, and then averaging those
distances, which should be a minimum for the optimal path.

From the outside in, again means that if the path is

ABCDEFG

then you'd look at the distances between A & G, B & F, and C & D, and
ignore E as that is the 0 case anyway.

So you'd compare that with the average from ANY other path using the
same starting point, like

ACBDEGF.

James Harris
[/QUOTE]

Verification