00:01
Hi, so we are given a network by seeing to that we have to answer the following question.
00:09
So let's have a look to the network first.
00:11
So this is what the network which we have been given from the question now asking that to find the shortest route from node one to node seven and this we have to done by using the big straw algorithm.
00:26
So this algorithm is a single source shortest algorithm from starting point to the ending point.
00:35
So if you see from the figure one is nothing but the starting point because we have been given an arrow over here and the ending point is nothing but seven.
00:45
So by the means of this algorithm we will start for the first part for the first we can write down that the shortest route the shortest route from so we will go one by one that is we say shortest route from node one to node seven is we have to compute.
01:11
So basically here we are considering the node one as base and route comes from three to four route comes from three and five sorry three and five.
01:30
So in between to that if you try to see the nodes distances is what that is node first to three and this is nothing but five.
01:45
You can clearly see from the figure from node one to five the distance is nothing but sorry what was that node three to five three to five node three to five the distance is what five here in the similar way if we consider node one to three node one to five let's say.
02:14
So this has the seven similarly from node one to three has the shortest cost.
02:28
Now next for the second part we can say next but node three to node seven has no route then next the take one to five because you can see from node three to seven from this node three to seven there is no maximum route it is directly and simple route of units five that is where we have to take from one to five...