00:01
So in this question we have this graph here that is showing the traveling cost as the traveling times from s to t.
00:08
And we have the other letters to represent the route from s to t.
00:16
So first we need to write out all paths from s to t and find the shortest one.
00:23
One so in this case we are gonna have seven which will be s then a bg t and then we can add the travel times for each one and to get 24 then we have as a a, b, g, d, t, with time 24 as well.
00:50
S, a, b, g, d, e, c, 23.
00:57
Then s, a, b, c, d, c, 26...