Jump to content

Recommended Posts

Hello people, so I am writing my math HL ia on the option discrete mathematics. More specifically on graph theory, and the traveling salesman problem. Does anyone know of any useful algorithms I could use in order to find the most efficient route between different points in the map. I just need the algorithm, everything else is ok. Would really appreciate the help, since the one I was going to use seems to have been taken down from the web. Anyways, thanks

Link to post
Share on other sites

Join the conversation

You can post now and register later. If you have an account, sign in now to post with your account.

Guest
Reply to this topic...

×   Pasted as rich text.   Paste as plain text instead

  Only 75 emoji are allowed.

×   Your link has been automatically embedded.   Display as a link instead

×   Your previous content has been restored.   Clear editor

×   You cannot paste images directly. Upload or insert images from URL.

×
×
  • Create New...