I said start here, no finish here :) -- Robert Anderson Nogueira de Oliveira _________________________ Tribunal de Justiça do Estado de Sergipe Graduando em Sistemas de Informação - UNIT MSN: ranophoe...@hotmail.com
"Ausência de evidência não é evidência de ausência." (Carl Sagan) On Mon, Apr 27, 2009 at 11:04 AM, Jarl Friis <j...@gavia.dk> wrote: > > Robert Anderson <ranom...@gmail.com> writes: > > > 1. (*) text/plain ( ) text/html > > > > Start here: > > > > http://en.wikipedia.org/wiki/A*_search_algorithm > > This algorithm finds shortest path from initial node to goal node. TSP > (Traveling SalesMan) is aobut visiting all nodes in a graph. > > Solving the TSP problem is not one of these problems for which there > eists a well known best algorithm. It belongs to the class NP [1], > well actuall it is known to be NPC [2], but you have read the section > regarding "Solving NP-complete problems" I suggest you read something > about branch-and-bound algorithms[3], and eventually use the A* search > algorithm as part of your BnB implementation. > > Jarl > > > Footnotes: > [1] > http://en.wikipedia.org/wiki/NP_(complexity)<http://en.wikipedia.org/wiki/NP_%28complexity%29> > > [2] http://en.wikipedia.org/wiki/NP-complete > > [3] http://en.wikipedia.org/wiki/Branch_and_bound > > > > > > --~--~---------~--~----~------------~-------~--~----~ You received this message because you are subscribed to the Google Groups "Ruby on Rails: Talk" group. To post to this group, send email to rubyonrails-talk@googlegroups.com To unsubscribe from this group, send email to rubyonrails-talk+unsubscr...@googlegroups.com For more options, visit this group at http://groups.google.com/group/rubyonrails-talk?hl=en -~----------~----~----~----~------~----~------~--~---
