00:01
So for this problem, we have to draw a path of journeys because we are visiting these four cities.
00:13
And we have a table that we are looking at in our question.
00:21
So we need to show how we can draw these four paths.
00:29
And so we start with tokyo, and then we have next bangkok, seoul, we have beijing, and then we have hong kong, so we have five cities.
00:44
And so, not four, sorry, we have these numbers here, which translate into the paths that we've drawn.
00:58
With a little bit of math.
01:03
And so this is what our route looks like with the cheapest link algorithm.
01:15
And so you can see how to move about the cheapest way.
01:27
So we're using this algorithm to find a hamiltonian circuit starting at the vertex of tokyo...
