Test PDF

Kruskal Algorithm
Minimum Spanning Trees
Ranjeet Kumar Rout
DR. B.R. Ambedkar NIT, Jalandhar
April 12, 2017
Ranjeet Kumar Rout (DR. B.R. Ambedkar NIT, Jalandhar)Kruskal Algorithm April 12, 2017 1 / 27
Table of Contents
Introduction
Overview
Algorithm
Example
Complexity
Application
Introduction
This algorithm first appeared in Proceedings of the American

Mathematical Society in 1956, and was written by Joseph Kruskal.
Introduction

It is a greedy algorithm , because at each step it adds to the forest an

edge of least possible weight.
Introduction

It is a greedy algorithm , because at each step it adds to the forest an

edge of least possible weight.
It comes under the category of path finding algorithms search.
Overview of Kruskal Algorithm:
Kruskal’s Algorithm is based directly on the generic Minimum

Spanning Tree algorithm.

It is an algorithm in graph theory that finds a minimum spanning tree
for a connected weighted graph.

It finds a subset of the edges that forms a tree that includes every
vertex, where the total weight of all the edges in the tree is minimized.

If the graph is not connected, then it finds a minimum spanning
forest.

If the graph is not connected, then it finds a minimum spanning
forest.
Kruskal’s algorithm is an example of a greedy algorithm because at
each step it adds to the forest an edge of least possible weight.
Algorithm: MST-KRUSKAL (G, w)
1 A=Φ
1 A=Φ
2 for each vertex v ∈ V [G ]
1 A=Φ
3 MAKE − SET (v )
1 A=Φ
3 MAKE − SET (v )
4 sort the edges of E [G ] into non decreasing order by weight w
1 A=Φ
3 MAKE − SET (v )
5 for each edge (u, v ) ∈ E [G ], taken in non decreasing order by weight
1 A=Φ
3 MAKE − SET (v )
6 if FIND − SET (u) 6= FIND − SET (v )
1 A=Φ
3 MAKE − SET (v )
7 then A = A ∪ {(u, v )}
1 A=Φ
3 MAKE − SET (v )
7 then A = A ∪ {(u, v )}
8 UNION(u, v )
1 A=Φ
3 MAKE − SET (v )
7 then A = A ∪ {(u, v )}
8 UNION(u, v )
9 return A
How Kruskal Algorithm works
Sort all the edges in non-decreasing order of their weight.

Pick the smallest edge. Check if it forms a cycle with the spanning
tree formed so far.

tree formed so far.
If cycle is not formed, include this edge. Else, discard it.

tree formed so far.
If cycle is not formed, include this edge. Else, discard it.
Repeat step 2 until there are (V − 1) edges in the spanning tree.
Example of Kruskal Algorithm
5
B D 4
2 1 3
2
8 A C
12
Given graph
5
B D 4 ←− Loop
2 1 3
2
Loop −→ 8 A C
12
Step 1: Remove all loops
5
B D 4 ←− Loop
2 1 3
2
Loop −→ 8 A C
12
Step 1: Remove all loops
Note
Any edge that starts and ends at the same vertex is called a Loop.
5
B D
2 1 3
2
A C
12
5
B D
2 1 3
2
A C
12
Step 2: Remove all parallel edges between two vertices except the one
with the least weight
5
B D
2 1 3
2
A C
12
Step 2: Remove all parallel edges between two vertices except the one
with the least weight
Note
Remove edge with weight 12 and keep 2 between A and C.
5
B D
2 1 3
2
A C
5
B D
2 1 3
2
A C
Step 3: Create the edge table
5
B D
2 1 3
2
A C
Step 3: Create the edge table

An edge table will contain the label of all the edges along with their
weight in ascending order.
Make all vertex as one one set by using MakeSet(), {A}, {B}, {C }, {D}
5
B D
2 1 3
2
A C
EDGE
WEIGHT
Make all vertex as one one set by using MakeSet(), {A}, {B}, {C }, {D}
5
B D
2 1 3
2
A C
EDGE
WEIGHT
Fill the 1st column of the table with the edge with minimum weight.
5
B D
2 1 3
2
A C
EDGE BC
WEIGHT 1
5
B D
2 1 3
2
A C
EDGE BC
WEIGHT 1
Select the edge of the next minimum weight and include it into the edge
table.
5
B D
2 1 3
2
A C
EDGE BC
WEIGHT 1
Select the edge of the next minimum weight and include it into the edge
table.
Note
In case we have two or more edges with the same weight then we select
them in any order.
5
B D
2 1 3
2
A C
EDGE BC AB AC
WEIGHT 1 2 2
5
B D
2 1 3
2
A C
EDGE BC AB AC
WEIGHT 1 2 2
Again select the edge of the next minimum weight and include it into the
edge table.
5
B D
2 1 3
2
A C
EDGE BC AB AC
WEIGHT 1 2 2
Again select the edge of the next minimum weight and include it into the
edge table.
Continue this process until all the edges are filled in the edge table.
5
B D
2 1 3
2
A C
EDGE BC AB AC DC
WEIGHT 1 2 2 3
5
B D
2 1 3
2
A C
EDGE BC AB AC DC BD
WEIGHT 1 2 2 3 5
5
B D
2 1 3
2
A C
EDGE BC AB AC DC BD
WEIGHT 1 2 2 3 5
Now we can find the minimum spanning tree from the edge table.
5
B D
2 1 3
2
A C
EDGE BC AB AC DC BD
WEIGHT 1 2 2 3 5
Now we can find the minimum spanning tree from the edge table.
Note
The graph has 4 vertices, so the minimum spanning tree will have 3 edges.
EDGE BC AB AC DC BD
WEIGHT 1 2 2 3 5
EDGE BC AB AC DC BD
WEIGHT 1 2 2 3 5
Step 4: 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.
Example of Kruskal Algorithm:
EDGE BC AB AC DC BD
WEIGHT 1 2 2 3 5
EDGE BC AB AC DC BD
WEIGHT 1 2 2 3 5
The edge BC has the smallest weight 1, so we will select BC and

A = A ∪ {(B, C )} So, A = {B, C } and Sets are {B,C},{A},{D}
EDGE BC AB AC DC BD
WEIGHT 1 2 2 3 5
The edge BC has the smallest weight 1, so we will select BC and

A = A ∪ {(B, C )} So, A = {B, C } and Sets are {B,C},{A},{D}
B D
1
A C
EDGE BC AB AC DC BD
WEIGHT 1 2 2 3 5
EDGE BC AB AC DC BD
WEIGHT 1 2 2 3 5
The edge AB has the next smallest weight 2 and it doesn’t form a circuit
with previously selected edges, so we will select AB. So, A = {A, B, C }
and Sets are {A, B, C},{D}
EDGE BC AB AC DC BD
WEIGHT 1 2 2 3 5
The edge AB has the next smallest weight 2 and it doesn’t form a circuit
with previously selected edges, so we will select AB. So, A = {A, B, C }
and Sets are {A, B, C},{D}
B D
2 1
A C
EDGE BC AB AC DC BD
WEIGHT 1 2 2 3 5
EDGE BC AB AC DC BD
WEIGHT 1 2 2 3 5
The edge AC has the next smallest weight 2 and it forms a circuit with
previously selected edges, so we will not select AC.
EDGE BC AB AC DC BD
WEIGHT 1 2 2 3 5
B D
2 1
2
A C
EDGE BC AB AC DC BD
WEIGHT 1 2 2 3 5
B D
2 1
2
A C
EDGE BC AB AC DC BD
WEIGHT 1 2 2 3 5
EDGE BC AB AC DC BD
WEIGHT 1 2 2 3 5
The edge DC has the next smallest weight 3 and it doesn’t form a circuit
with previously selected edges, so we will select DC. So, A = {A, B, C , D}
and Sets are {A, B, C, D}
EDGE BC AB AC DC BD
WEIGHT 1 2 2 3 5
The edge DC has the next smallest weight 3 and it doesn’t form a circuit
with previously selected edges, so we will select DC. So, A = {A, B, C , D}
and Sets are {A, B, C, D}
B D
2 1 3
A C
Since we have 3 edges connecting all the 4 vertices of the graph we will
stop now.
B D
2 1 3
A C
Required minimum spanning tree.
Complexity Analysis
The Time complexity of Kruskal Algorithm is O(ElogE ) or O(ElogV ).
Complexity Analysis

Sorting of edges takes O(ELogE ) time.
Complexity Analysis

After sorting, we iterate through all edges and apply find-union
algorithm.
Complexity Analysis

algorithm.
The find and union operations can take at most O(LogV ) time.
Complexity Analysis

algorithm.
So overall complexity is O(ELogE + ELogV ) time.
Complexity Analysis

algorithm.
The value of E can be at most V 2 , so O(LogV ) and O(LogE ) is same.
Complexity Analysis

algorithm.
Therefore, overall time complexity is O(ElogE ) or O(ElogV ).
Complexity Analysis

algorithm.
Therefore, overall time complexity is O(ElogE ) or O(ElogV ).
Kruskal Algorithm has a linear memory complexity.
Applications
Artificial Intelligence
Game Development
Cognitive Science
References
Introduction to Algorithm -Thomas H. Corman,Ronald L. Rivest,

Charles F. Leiserson.
http://www.geeksforgeeks.org/greedy-algorithms-set-2-kruskals-
minimum-spanning-tree-mst/
https://www.quora.com/What-are-practical-real-life-industrial-
applications-of-Dijkstra-Kruskal-and-Prims-Algortithm
The End
Thank You

Test PDF

Uploaded by

Document Information

Original Description:

Original Title

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

Test PDF

Uploaded by

Copyright:

Available Formats

Kruskal Algorithm

Minimum Spanning Trees

Ranjeet Kumar Rout

DR. B.R. Ambedkar NIT, Jalandhar

April 12, 2017

This algorithm first appeared in Proceedings of the American

This algorithm first appeared in Proceedings of the American

It is a greedy algorithm , because at each step it adds to the forest an

This algorithm first appeared in Proceedings of the American

It is a greedy algorithm , because at each step it adds to the forest an

It comes under the category of path finding algorithms search.

Kruskal’s Algorithm is based directly on the generic Minimum

Kruskal’s Algorithm is based directly on the generic Minimum

Kruskal’s Algorithm is based directly on the generic Minimum

Kruskal’s Algorithm is based directly on the generic Minimum

Kruskal’s Algorithm is based directly on the generic Minimum

Sort all the edges in non-decreasing order of their weight.

Sort all the edges in non-decreasing order of their weight.

Sort all the edges in non-decreasing order of their weight.

Sort all the edges in non-decreasing order of their weight.

Step 1: Remove all loops

Step 1: Remove all loops

Step 3: Create the edge table

Step 3: Create the edge table

The edge BC has the smallest weight 1, so we will select BC and

The edge BC has the smallest weight 1, so we will select BC and

Required minimum spanning tree.

The Time complexity of Kruskal Algorithm is O(ElogE ) or O(ElogV ).

The Time complexity of Kruskal Algorithm is O(ElogE ) or O(ElogV ).

The Time complexity of Kruskal Algorithm is O(ElogE ) or O(ElogV ).

The Time complexity of Kruskal Algorithm is O(ElogE ) or O(ElogV ).

The Time complexity of Kruskal Algorithm is O(ElogE ) or O(ElogV ).

The Time complexity of Kruskal Algorithm is O(ElogE ) or O(ElogV ).

The Time complexity of Kruskal Algorithm is O(ElogE ) or O(ElogV ).

The Time complexity of Kruskal Algorithm is O(ElogE ) or O(ElogV ).

Introduction to Algorithm -Thomas H. Corman,Ronald L. Rivest,

You might also like