QUANTITATIVE

METHODS
Minimal Spanning Tree
PGPM-09 SEC(A)
GLOBSYN BUSINESS SCHOOL

Rajesh Kar
 
 Minimal Spanning Tree Model
 Spanning tree of a graph is an undirected
tree consisting of only those nodes that are
necessary to connect all the vertices in the
original graph.
EXAMPLE :-
1 4
SP
1 4 A
N 5
NI
5
N 2 3
G
T
2 3 R
EE 1 4
ORIGINAL TREE
5

2 3
 TYPES OF SPANNING
TREE
 DEPTH FIRST SEARCH
 ONLY FORWARD PATHS SELECTED

 MINIMUM CONNECTION TO ONE NODE

1 2

4 3
 TYPES OF SPANNING
TREE
 BREADTH FIRST SEARCH
 REVERSE PATH ALSO ALLOWED HERE

 ONE NODE CONNECTED TO MANY NODES

1 2

4 3
 OBJECTIVE OF THE
MODEL
 The Main Objective of the model is to Estimate the
minimum cost or select the minimum path which connect
all nodes or edges .

 The model is useful to minimize the cost or to achieve the

maximum desirable goal.
 PROCESS TO ACHIEVE
THE OBJECTIVE
 EXAMPLE WITH PROBLEM
o The park service plans to develop a wilderness area for tourism. Four
locations in the area are designated for automobile access.To inflict the
least harm on the environment, the park service wants to minimize the
miles of roadway required to provide the desired accessibility. How the
roads should be built to achieve this object.

P W M S T

Park entrance(P) -------- 7.1 19.5 19.1 25.7

Wild falls (W) 7.1 ----------- 8.3 16.2 3.2

Majestic rock (M) 19.5 8.3 ---------- 18.1 5.2

Sunset point (S) 19.1 16.2 18.1 ---------- 17.2

The meadow (T) 25.7 13.2 5.2 17.2 ---------

SOLUTION
STEP 1 ANSWER
DIAGRAM

W W

7.1 16.2 7.1 16.2

13.2 8.3
19.1 8.3
P S P S
19.5 17.2

25.7 18.1
5.2
T M T M
5.2
THANK YOU
 