Recording:
Screen_Recording_20230123_164030_DentReality-Task.mp4
For Task 3, I would implement a custom solution of the traveling salesman problen.
For now, we will create a matrix of distances of every city relative to one another.
Currently my proposed solution is permutating routes and appending them to an array and using the minimum weight as my solution.