Travelling salesman problem

[Artur]

And how many is different the shortest roads ?

Artur pisze:
> I was think about travelling salseman problem (Problem NP 
> completeness). If problem is poor defined let on the start in 
> symmetric trangular graphs with constant distance between neighborough 
> vertices
> these graphs have n2 vertices. Sealsman have to reached each vertice 
> (but not necessary go through each edge and some edge two times 
> available)
>
> For 4  vertices  (S=Start F=Finsih)
>
>  F
> x     x
>  S
>
> For 9 vertices
>      F
>   x    x
> x     x      x
> x      x
>     S
> etc
>
> __________ NOD32 Informacje 2701 (20071204) __________
>
> Wiadomosc zostala sprawdzona przez System Antywirusowy NOD32
> http://www.nod32.com lub http://www.nod32.pl
>
>