00:01
Hello everyone, to solve the travelling problem for the given graph we need to find the total weight of all hamilton circuits and determine the circuit with the minimum total weight.
00:11
Given ab equal to 70, bc equal to 15, ac equal to 20, ad equal to 30, bd equal to 50 and cd equal to 10.
00:28
To find the total weight of all hamilton circuits we need to consider all possible circuits that visit each vertex exactly once.
00:36
There are three possible circuits in this case.
00:41
Three possible circuits.
00:47
So those are, the first one is a to b to c to d to a, second one is a to d to c to b to a and the third one is a to b to d to c to a.
01:09
Let's calculate total weight for each circuit.
01:12
So for the first one, one a to b to c to d to a, total weight equal to ab plus bc plus cd plus da that is equal to 70 plus 15 plus 10 plus 30 that is 125.
01:39
Now for the second one, a to d to c to b to a...
