Research: 3 ways to do routing #222
Loading…
Add table
Add a link
Reference in a new issue
No description provided.
Delete branch "%!s()"
Deleting a branch is permanent. Although the deleted branch may continue to exist for a short time before it actually gets removed, it CANNOT be undone in most cases. Continue?
I'd like you to create 3 different programs that solve the following problem:
"Given a list of 10 different locations, what is the best routing to drive between these locations?"
It's fine to use 3rd party vendors, APIs, services, or whatever. The goal is to try out different ways to solve the problem. At the end of this project I'd like to have the programs and your opinion on the strengths and weaknesses of the different approaches you tried.
For sure. Will work on this problem. General plan, stop me if this is wrong
@eliribble
For the first part I am going to assume that there is a road between each point, if needed and you want me to implement it I can add mock roads or use roads from reality
You're welcome to research algorithms if you'd like. You can also jump directly to using pre-packaged services that can solve the algorithmic portion:
I'm happy to pay for access to things for you to try as well.