--- Ashish Kulkarni wrote:
> i have to find the shortest distance to travel, but
> this is not as simple as travel sales man problem
> because A-B is not as same as B-C
That *is* the traveling salesman problem.
There are many homework and algorithm sites that can
help you, and googling for various Java performance
search terms should give you much more information
than you'll want.
d.
____________________________________________________________________________________
Fussy? Opinionated? Impossible to please? Perfect. Join Yahoo!'s user panel
and lay it on us. http://surveylink.yahoo.com/gmrs/yahoo_panel_invite.asp?a=7
---------------------------------------------------------------------
To unsubscribe, e-mail: [EMAIL PROTECTED]
For additional commands, e-mail: [EMAIL PROTECTED]
