Project name: Application of Kruskals algorithm
a presentation based on the revised Makaut/Wbut syllabus
for students who studies mathematics or data structure,graph theory
3. Method
•Requirement for finding MST:- A Weighted Graph
EXAMPLE:- Let us consider the following graph.
•To perform:-We will find MST for the above graph shown in
..........................the image.
4. Steps
1.
Removing all the loops present.
• Any edge that starts and ends at the same vertex is known as loop.
Loops are marked in the image given below.
5. Steps
2.
Removing all the parallel edges between two vertex except the
one with least weight
• In this graph, vertex A and C are connected by
two parallel edges having
weight 2 and 12 respectively.
• So, we will remove 12 and keep 2.
Parallel edges to be removed is shown in
this figure:-
6. Steps
3.
To Create the edge table
• An edge table will have name of all the edges along with
their weight is ascending order.
• Now ,in the graph there are total 5 edges.
So our edge table will have 5 columns.
The Edge Table is as follows:-
7. • To find the MST (Minimum Spanning Tree) we will start
from the smallest weight edge and keep selecting edges
that does not form any circuit with the previously selected
edges.
Resultant MST:-
RESULT
NOTE:- AC & BD are not connected as they forms a circuit
8. DISCUSSION CONCLUSION
1. https://bit.ly/2Bfy1pY
2. https://bit.ly/2lHh1Bb
3. BCA Mathematics book--Semester 3
Thus it can be concluded that ,Kruskal's algorithm is a minimum
spanning tree algorithm that takes a graph as input and finds the
subset of the edges of that graph which
• form a tree that includes every vertex
• has the minimum sum of weights among all the trees that can be formed
from the graph.
BIBLIOGRAPHY
&
