#Been trying to figure this out, i can get it right. Please help
22 messages · Page 1 of 1 (latest)
that doesn't make sense
they mean you use the 5 smallest edges
nvm that doesn't work
brute force means you try 01234, 01243, 01324...
exhaustive search, can't even stop early
so it can only be done with a computer there's 120 steps
so it doesn't make sense
Do you know a computer method to get the answer? i could try that and work backwards
<@&286206848099549185>
Just try out all different permutations of 01234
use total enumeration
aka give each permutation a number from 1 to 120, and iterate through all possible permutations
keep track of the minimum weight
the graph is complete, so this shouldn't be too tough
one little detail to keep in mind, is that you always need to go back to 0 at the end to complete the cycle. So don't forget to add that in the end
Oh yeah, you can assume 0 is the start, so there's only 24 options not 120
And then you can assume 1 is either second or third, so only 12
It has the same weight sum if you go backwards