Kruskal's algorithm is a minimum spanning tree algorithm that efficiently finds the least weight edge connecting trees in a forest, with a time complexity of O(e log e). It is capable of creating minimum spanning forests and can be adjusted for adding nodes and edges after the initial solution. The algorithm identifies a subset of edges that connects every vertex with minimal total weight and no cycles.

2. PRESENTED BY: Sourov Purkayastha
ID NO:171-115-178
BATCH:41st (E)
Dept. of CSE, Metropolitan University

3. Kruskal’s algorithm is a minimum spanning-
tree algorithm which finds an edge of the least
possible weight that connects any two trees in
the forest.
The time complexity of kruskal’s algorithm is
0(E log E).

4. Kruskal’s Algorithm is a convenient way to
calculate minimum spanning trees.The ability to
find minimum spanning forests when a single
tree doesn’t exist is a powerfull benefit of
kruskal’s Algorithm .An additional benefit is
that it can be modified to conveniently handle
adding nodes and edges to the graph after an
initial solution is found. Finally told
that,Kruskal’s Algorithm is efficient and
optimal.

5. • Kruskal’s Algorithm finds the minimum
spanning tree of a weighted graph.
• Minimum Spanning Tree is a subset of edges
that
1.Reaches every vertex
2.Has minimum total weight
3.Has no cycles
Kruskal’s does this by relaxing edges starting with
the cheapest edges first

7. Landing cable TV networking Tour operation

8. Any question ?