Scribd
Upload
52 views13 pages

Minimum Spanning Tree: Dr.K.R.Jothi Associate Professor Scope

The document discusses minimum spanning trees (MST), which are subsets of graphs that connect all vertices using the minimum number of edges. It describes properties of MSTs such as being acyclic, having n-1 edges for n vertices, and being uniquely defined. Applications of MSTs include network design and clustering algorithms. The document also explains Kruskal's and Prim's algorithms for finding MSTs in graphs. Kruskal's approach treats the graph as a forest and connects trees with minimum cost edges, while Prim's algorithm grows a tree from an initial node by adding adjacent minimum cost edges.

Uploaded by

Ashutosh Devkota
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
52 views13 pages

Minimum Spanning Tree: Dr.K.R.Jothi Associate Professor Scope

The document discusses minimum spanning trees (MST), which are subsets of graphs that connect all vertices using the minimum number of edges. It describes properties of MSTs such as being acyclic, having n-1 edges for n vertices, and being uniquely defined. Applications of MSTs include network design and clustering algorithms. The document also explains Kruskal's and Prim's algorithms for finding MSTs in graphs. Kruskal's approach treats the graph as a forest and connects trees with minimum cost edges, while Prim's algorithm grows a tree from an initial node by adding adjacent minimum cost edges.

Uploaded by

Ashutosh Devkota
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
You are on page 1/ 13

Minimum Spanning

Tree
Dr.K.R.Jothi
Associate Professor
SCOPE
Minimum Spanning Tree (MST)
• A spanning tree is a subset of Graph G, which has all the vertices covered
with minimum possible number of edges. Hence, a spanning tree does
not have cycles and it cannot be disconnected.
Properties of MST
• A connected graph G can have more than one spanning tree.
• All possible spanning trees of graph G, have the same number of edges
and vertices.
• The spanning tree does not have any cycle (loops).
• Removing one edge from the spanning tree will make the graph
disconnected, i.e. the spanning tree is minimally connected.
• Adding one edge to the spanning tree will create a circuit or loop, i.e. the
spanning tree is maximally acyclic.
Mathematical Properties
• Spanning tree has n-1 edges, where n is the number of nodes
(vertices).
• From a complete graph, by removing maximum e - n + 1 edges, we
can construct a spanning tree.
• A complete graph can have maximum nn-2 number of spanning trees.
Applications of MST
• Minimum spanning tree has direct application in the design of
networks. It is used in algorithms approximating the travelling
salesman problem, multi-terminal minimum cut problem and
minimum-cost weighted perfect matching.
• Other practical applications are:
• Cluster Analysis
• Handwriting recognition
• Image segmentation
• Civil Network Planning
• Computer Network Routing Protocol
Kruskal's algorithm
• To find the minimum cost spanning tree uses the greedy approach.
• This algorithm treats the graph as a forest and every node it has as an
individual tree.
• A tree connects to another only and only if, it has the least cost
among all available options and does not violate MST properties.
Kruskal's algorithm
• Remove all loops and Parallel Edges
• Arrange all edges in their increasing order of weight
• Add the edge which has the least weightage
Kruskal's algorithm
STEP 1
STEP 2

STEP 3 (Iterative)
Prim's algorithm
• Remove all loops and parallel edges
• Choose any arbitrary node as root node
• Check outgoing edges and select the one with less cost
Start
Node
Exercise – Kruskal’s Algorithm
Exercise – Prim’s Algorithm

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy