Prims Algorithm

Prim Algorithm
Minimum Spanning Trees
Ranjeet Kumar Rout
DR. B.R. Ambedkar NIT, Jalandhar
April 11, 2017
Ranjeet Kumar Rout (DR. B.R. Ambedkar NIT, Jalandhar) Prim Algorithm April 11, 2017 1 / 17
Overview
Introduction
Algorithm
Example
Complexity
Application
Introduction
Spanning Tree
If we have a graph G(V,E) where V is the no of vertices and E is the no of

edges in a graph then a spanning tree G’(V’, E’) of a Graph G, have
V’ = V
Introduction
Spanning Tree

V’ = V
E’ = E-1
Introduction
Spanning Tree

V’ = V
E’ = E-1
Acyclic
Introduction
Spanning Tree

V’ = V
E’ = E-1
Acyclic
Connected
Minimum Spanning Tree:
A minimum spanning tree is a spanning tree with weight less than or equal
to the weight of every other spanning tree.
Connected
Connected
Acyclic
Connected
Acyclic
Minimum Weight
Prim’s Algorithm
Developed by Vojtech Jarnikin and Robert Prim.
Prim’s Algorithm

Prim’s algorithm is a greedy algorithm that is used to find the
minimum cost spanning tree for connected, weighted, undirected
graph.
Prim’s Algorithm

graph.
The tree starts from an arbitrary root vertex r and grows until the
tree spans all the vertices in V.
Prim’s Algorithm

graph.
Each step adds to the tree A a light edge that connects A to an
isolated vertex–one on which no edge of A is incident.
Prim’s Algorithm

graph.
This rule adds only edges that are safe for A; therefore, when the
algorithm terminates, the edges in A form a minimum spanning tree.
Prim’s Algorithm

graph.
This rule adds only edges that are safe for A; therefore, when the
algorithm terminates, the edges in A form a minimum spanning tree.
This strategy qualies as greedy since at each step it adds to the tree
an edge that contributes the minimum amount possible to the trees
weight.
Algorithm: MST-PRIM(G,w,r)
1 for each u ∈ G .V
2 u.key = ∞
2 u.key = ∞
3 u.π = NIL
2 u.key = ∞
3 u.π = NIL
4 r.key = 0
2 u.key = ∞
3 u.π = NIL
4 r.key = 0
5 Q = G.V
2 u.key = ∞
3 u.π = NIL
4 r.key = 0
5 Q = G.V
6 while Q 6= φ
2 u.key = ∞
3 u.π = NIL
4 r.key = 0
5 Q = G.V
6 while Q 6= φ
7 u = EXTRACT-MIN(Q)
2 u.key = ∞
3 u.π = NIL
4 r.key = 0
5 Q = G.V
6 while Q 6= φ
8 for each v ∈ G .Adj[u]
2 u.key = ∞
3 u.π = NIL
4 r.key = 0
5 Q = G.V
6 while Q 6= φ
9 if v ∈ Q and w (u, v ) ≤ v .key
2 u.key = ∞
3 u.π = NIL
4 r.key = 0
5 Q = G.V
6 while Q 6= φ
10 v .π = u
2 u.key = ∞
3 u.π = NIL
4 r.key = 0
5 Q = G.V
6 while Q 6= φ
10 v .π = u
11 v .key = w (u, v )
Example
Prim’s Algorithm
Minimum cost Spaning Tree : Apply Prim’s Algo
10 28
12
25 16
24
18
22 14
Example
Prim’s Algorithm
10 28 10
12
25 16
24
18
22 14
Example
Prim’s Algorithm
10 28 10
12
25 16 25
24
18
22 14
Example
Prim’s Algorithm
10 28 10
12
25 16 25
24
18
22 14 22
Example
Prim’s Algorithm
10 28 10
12
25 16 25
24
18
22 14 22 14
Example
Prim’s Algorithm
10 28 10
12
25 16 25 16
24
18
22 14 22 14
Example
Prim’s Algorithm
10 28 10
12 12
25 16 25 16
24
18
22 14 22 14
Complexity Analysis
The Time complexity of Prim Algorithm is O(ElogV ).
Complexity Analysis

The running time of Prim’s algorithm depends on how we implement
the minpriority queue Q.
Complexity Analysis

The body of the while loop executes |V | times, and since each
EXTRACT-MIN operation takes O(lgV ) time, the total timefor allcalls
to EXTRACT-MIN is O(VlgV ) .
Complexity Analysis

The for loop in lines 8-11 executes O(E) times altogether
Complexity Analysis

The for loop in lines 8-11 executes O(E) times altogether
Thus, the total time for Prims algorithm is
O(VlgV + lgV ) = O(ElogV ) time.
Applications
All this path finding algorithms are used in AI (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

Prims Algorithm

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

Prims Algorithm

Uploaded by

Copyright:

Available Formats

Prim Algorithm

Minimum Spanning Trees

Ranjeet Kumar Rout

DR. B.R. Ambedkar NIT, Jalandhar

April 11, 2017

If we have a graph G(V,E) where V is the no of vertices and E is the no of

If we have a graph G(V,E) where V is the no of vertices and E is the no of

If we have a graph G(V,E) where V is the no of vertices and E is the no of

If we have a graph G(V,E) where V is the no of vertices and E is the no of

Developed by Vojtech Jarnikin and Robert Prim.

Developed by Vojtech Jarnikin and Robert Prim.

Developed by Vojtech Jarnikin and Robert Prim.

Developed by Vojtech Jarnikin and Robert Prim.

Developed by Vojtech Jarnikin and Robert Prim.

Developed by Vojtech Jarnikin and Robert Prim.

The Time complexity of Prim Algorithm is O(ElogV ).

The Time complexity of Prim Algorithm is O(ElogV ).

The Time complexity of Prim Algorithm is O(ElogV ).

The Time complexity of Prim Algorithm is O(ElogV ).

The Time complexity of Prim Algorithm is O(ElogV ).

All this path finding algorithms are used in AI (Artificial Intelligence)

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

You might also like