00:01
In this question, there is a following graph and first is to use a prism algorithm to find the minimum spanning tree above the graph and use the kruskal algorithm to find a minimum spanning tree and compare between the prism algorithm and kruskal algorithm.
00:19
So the graph is given.
00:21
So, the prism algorithm start at any vertex let's say a, add edge ac, weight 4, add the edge bc, weight 3 and add the edge bd, weight 5.
00:43
So the result minimum spanning tree is look like and the total weight is equal to 12.
00:53
Now coming to the kruskal algorithm.
01:14
So sort edge by weight ac, 4, bc, 3, cd, 6, ab, 5, bd, 5, ad, 7.
01:34
So add edge bc, 3, add edge ac, 4, add edge bd, 5.
01:51
So the result is minimum spanning tree is look like.
01:57
This is a rough graph, not a perfect.
02:01
I will make here only for a rough sketch idea.
02:09
So the total weight is 12...
