00:01
In this question, we need to solve this minimization problem for the following directed multi -stage graph to find the minimum cost path between the vertex 1 and vertex 11.
00:12
Okay, so we have to find the minimum cost path from vertex 1 to the vertex 11.
00:26
Using tabulation method and dynamic program, we can solve this.
00:30
Okay.
00:31
So first of all, we have four.
00:32
Four stages here okay so this corresponds to the first test these three corresponds to the second stage and these four vertices corresponds to the third stage this is our fourth stage and this is the last stage correct so i will write down a formula for the cost so cost of i comma j is equal to minimum of c of j comma l okay j comma l plus the cost i plus one comma l okay where j and l they belongs to the vertices e okay okay and here we can see and l they belongs to the vertices e okay okay and here we can see that i represent which stays the vertex belongs to and j represent the vertex number okay so this is how our cost function is given by now we have to draw the table as well so table we are going to draw and let us see what we are going to do correct so first of all i am going to draw the vertices from 1 till 11.
02:06
So let us see how we are going to do this.
02:09
So here i will write down the vertices, correct.
02:15
And then we have to write down the cost.
02:19
And finally, we have to write down the value...