00:01
So according to dijok's algorithm, let us make a flow chart.
00:05
This point is representing san franke's core.
00:09
This is los angeles.
00:12
Both are at a distance of 3 .49.
00:15
And from here, this is bonware.
00:19
This is attached in this way.
00:23
So this is from here, 957, and this is from 834.
00:28
And from here, here it is chicago.
00:31
Chicago from barmer will be 908 from here it will be 1855 and from after that chicago after that there is new york so new york is 722 from chicago and from seven wrinkles score new york will be 2534 and from los angeles it will be 24551 then new york there is atlan this is from here chicago it is 606 from atlanta to new york it is 760 and from here it is boston from there chicago to boston it is 860 and new york to boston it is 191 and here it is miami from atlanta to miami it is 545 and from new york to miami it is 1090 so this is algorithm find the minimum path from one vertex to all other vertices of the graph so from here we can say that a distance needed to find the minimum distance between the san francisco san francisco and we can say that here is boston so we have to find out a minimum distance between san francisco and the boston we have to start either from boston or from san francisco let's say this is san francisco.
02:08
This is from 0 to 0 here.
02:12
This is, let's say, los angeles...