Scribd
Upload
84 views

Minimum Spanning Tree Algorithm: Aor Case Study Assignment

1. Saransh was tasked with installing servers in Venice while avoiding running cables over waterways. He used the minimum spanning tree method to design an efficient cable network. 2. The solution identifies 12 server locations in Venice and calculates the distances between them. It then connects the locations with the shortest routes possible without crossing water, resulting in a total cable length of 40km. 3. The minimum spanning tree algorithm provides the most optimized network path by sequentially connecting the closest unmatched points until all are linked at the minimum total distance.

Uploaded by

Rupam Biswas
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
84 views

Minimum Spanning Tree Algorithm: Aor Case Study Assignment

1. Saransh was tasked with installing servers in Venice while avoiding running cables over waterways. He used the minimum spanning tree method to design an efficient cable network. 2. The solution identifies 12 server locations in Venice and calculates the distances between them. It then connects the locations with the shortest routes possible without crossing water, resulting in a total cable length of 40km. 3. The minimum spanning tree algorithm provides the most optimized network path by sequentially connecting the closest unmatched points until all are linked at the minimum total distance.

Uploaded by

Rupam Biswas
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 8

Minimum

Spanning Tree
Algorithm
AOR CASE STUDY ASSIGNMENT

19020841014 Kshitij Anand


19020841073 Aniket Patil
19020841053 Pratik Bhamre
19020841137 Rupam Biswas
19020841141 Saransh Bansal
CASE STATEMENT

Mr. Saransh Agarwal has been recently posted at the office of Xfinity, a leading cable internet
provider in Venice. He recently relocated from India and was amazed to see the intricate
waterways and transportation channels of the city which added to its beauty.
He was assigned with the task of identifying the important points in the city where new
servers have to be installed and connect them without covering the waterways in the most
efficient way. Keeping the beauty of the city in mind, he decided to use the minimum
spanning tree method to lay out the cable design network for the places which he identified
and marked on a map.
Saransh consulted his friends from SIBM-B to help him design the network map. So our task
is to Determine the exact cable network and length to be constructed for this project.

Figure 1: Map of Venice


SCOPE OF MINIMUM SPANNING TREE

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.
By this definition, we can draw a conclusion that every connected and undirected Graph G
has at least one spanning tree. A disconnected graph does not have any spanning tree, as it
cannot be spanned to all its vertices.

Figure 2 Spanning trees

We found three spanning trees off one complete graph. A complete undirected graph can
have maximum nn-2 number of spanning trees, where n is the number of nodes. In the above
addressed example, n is 3, hence 33−2 = 3 spanning trees are possible.

Properties of spanning trees


We now understand that one graph can have more than one spanning tree. Following are a
few properties of the spanning tree connected to graph G −
 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.

Application of spanning trees


Spanning tree is basically used to find a minimum path to connect all nodes in a graph.
Common application of spanning trees are −
 Civil Network Planning
 Computer Network Routing Protocol
 Cluster Analysis

Minimum spanning trees


In a weighted graph, a minimum spanning tree is a spanning tree that has minimum weight
than all other spanning trees of the same graph. In real-world situations, this weight can be
measured as distance, congestion, traffic load or any arbitrary value denoted to the edges.
SOLUTION

STEP 1
WE have to identity all the nodes on the map of Venice where the servers have to be
installed.

Cannaregio Ponte Scalzi Santa Corce Dell ‘Orto


(A) (B) (C) (D)

Ferrovia San Polo Piazzale Roma Dorso Duro


(E) (F) (G) (H)

Arsenale St. Mark


San Marco Castello
Basilica
(I) (J) (K)
(L)

Figure 3: Server Locations

STEP 2
We have to identify the displacement between the points keeping in mind that the
cable cannot cross any water body.
Table 1: Distance between the nodes (in Km)

LOCATION A B C D E F G H I J K L
A 0 6 6 6 - - - - - - - -
B 0 1 - 2 - - - - - - -
C 0 2 7 - 2 - - - - -
D 0 - - - - - 18 - -
E 0 4 - - - - - -
F 0 11 10 - - - -
G 0 22 2 - - -
H 0 12 - 25 -
I 0 1 16 -
J 0 - 8
K 0 3
L 0
STEP 3
Let us consider,
C_k = set of nodes that is permanently connected after iteration k
C'_k = set of nodes that is yet to be connected after iteration k
So, Initially C_k = NULL but at the end C'_k = NULL.

STEP 4
Node 1 is in the first set, and all other unconnected nodes in the other set. Then we
check the possible connections from the first.

STEP 5
We repeat step 4, starting from first set having two nodes now, and all other
unconnected nodes in the other set.

Possible Routes Distance (Kms)


A,B 6
A,C 6
A,D 6
B,C 1
B,E 2
C,D 2
C,E 7
C,G 2
D,J 18
E,F 4
F,G 11
F,H 10
G,H 22
G,I 2
H,I 12
H,K 25
I,J 1
I,K 16
J,L 8
K,L 3
Connected Not Yet Connected Connected Distance
Path
Step 1 B A,C,D,E,F,G,H,I,J,K,L NULL 0
Step 2 B,C A,D,E,F,G,H,I,J,K,L BC 1
Step 3 B,C,E A,D,F,G,H,I,J,K,L BE 2
Step 4 B,C,E,A D,F,G,H,I,J,K,L BA 6
Step 5 B,C,E,A,D F,G,H,I,J,K,L CD 2
Step 6 B,C,E,A,D,G F,H,I,J,K,L CG 2
Step 7 B,C,E,A,D,G,F H,I,J,K,L EF 4
Step 8 B,C,E,A,D,G,F,I H,J,K,L GI 1
Step 9 B,C,E,A,D,G,F,I,H J,K,L FH 10
Step 10 B,C,E,A,D,G,F,I,H,J K,L IJ 1
Step 11 B,C,E,A,D,G,F,I,H,J K JL 8
Step 12 B,C,E,A,D,G,F,I,H,J,K NULL LK 3
TOTAL
40 Km
DISTANCE

B
C
D

E
G L
J
K

F
I

INDICATES THE DESIRED NETWORK PATH

INDICATES THE ALTERNATIVE PATHS


INTERPRETATION

The above solution clearly shows us that the most optimized network path length would be
40 Kms, given the constraint that cable cannot be laid over any water body.
The schematic diagram shows the network path which is to be followed to lay the cable
network in Venice. The red arrow shows the desired path whereas the blue dotted path shows
the other possible network path option.

LEARNING FROM THE CASE

Spanning Tree is a subset of an undirected and connected graph in which all the nodes
of the graph are connected with each other with the help of (n-1) edges where n is the
number of nodes or vertices present in the graph G.
Minimum Spanning Tree is that Spanning Tree whose cost is the least among all the
possible Spanning Trees. The cost of a Spanning Tree is the sum of the weight of all
the edges that are present in that Spanning Tree.
there are two algorithms or techniques that are used; Kruskal's Algorithm & Prim's
Algorithm.

You might also like