Jump to content
  • Advertisement
Sign in to follow this  
widggman

Hamiltonian circuit

This topic is 3764 days old which is more than the 365 day threshold we allow for new replies. Please post a new topic.

If you intended to correct an error in the post then please contact us.

Recommended Posts

Hi! I have a little presentation for an algorithm course to do and it's about "Hamiltonian Path" I'm trying to find information on algorithm about that subject. I know the classic algorithm running in O((n-1)!). But is there a better algorithm ?? And I'm not talking about randomized or heuristic algorithm. Only algorithm which can work on all kind of graph. thanx

Share this post


Link to post
Share on other sites
Advertisement
http://en.wikipedia.org/wiki/Travelling_Salesman_Problem

http://www.andrew.cmu.edu/user/neils/tsp/index.html

Share this post


Link to post
Share on other sites
Sign in to follow this  

  • Advertisement
×

Important Information

By using GameDev.net, you agree to our community Guidelines, Terms of Use, and Privacy Policy.

We are the game development community.

Whether you are an indie, hobbyist, AAA developer, or just trying to learn, GameDev.net is the place for you to learn, share, and connect with the games industry. Learn more About Us or sign up!

Sign me up!