O(1) solution to travelling salesman problem

Yo, we ultimately got a O(1) solution to the travelling salesman problem. No more super computers no complicated graph. This is how you can do it:

So get your school assignments done.

3 thoughts on “O(1) solution to travelling salesman problem”

Enter your comment here...

Fill in your details below or click an icon to log in:

Email (required) (Address never made public)

Name (required)

Website

You are commenting using your WordPress.com account. ( Log Out / Change )

You are commenting using your Google+ account. ( Log Out / Change )

You are commenting using your Twitter account. ( Log Out / Change )

You are commenting using your Facebook account. ( Log Out / Change )

Connecting to %s