spanishdude6 Posted March 3, 2020 Report Share Posted March 3, 2020 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 Reply Link to post Share on other sites More sharing options...
Recommended Posts
Join the conversation
You can post now and register later. If you have an account, sign in now to post with your account.