Introduction Application of MST MST Construction Using Prims Algorithm Prim's Algorithm Time Complexity Analysis
Introduction Application of MST MST Construction Using Prims Algorithm Prim's Algorithm Time Complexity Analysis
Introduction
Application of MST
MST construction using Prims algorithm
Prim’s Algorithm
Time complexity Analysis
Introduction
• Prim’s algorithm is used to find the Minimum Spanning Tree (MST) of a
given graph. The graph must be weighted, connected and undirected.
• A spanning tree is a subset of Graph G, which has all the vertices covered
with minimum possible number of edges..
• Spanning tree must not contain any cycle and all vertices must be connected.
• For a given weighted graph, many number of spanning trees are possible.
Minimum spanning tree is a one which has minimum weight than all other
spanning trees of the same graph.
• A minimum spanning tree has (V – 1) edges where V is the number of
vertices in the given graph.
Example
Saveetha Engii
Application
Consider telecommunications company trying to lay cable in a new
neighborhood. It can bury the cable from one of the near by house. Some
of the paths might be more expensive, because they may be longer, or
require the cable to be buried deeper.