TELEPHONE WIRING USING MINIMUM SPANNING

TREE
Under the Guidance

Mrs. Sujata
By Team 2

Arpita Patil - 02 Nitya .N. Kulkarni - 07 Pooja .R. Bhat - 08

CONTENTS
Algorithm Modules Test

Design

Cases Conclusion References

ALGORITHM DESIGN

MODULES

TEST CASES

EXAMPLE
Number of homes: 4 Cost of Finolex 2 pair telephone wire per meter: Rs.620 Distance matrix- Distance in meters

Home1 Home1 Home2 Home3 Home4 0 6 14 8 Home2 6 0 30 4 Home3 14 30 0 20 Home4 8 4 20 0 office 22 40 7 18

2
24800

3720

13640 8680 18600 4960 2480

4340

11160

12400

Node 5 is office

NORMAL EXECUTION

Cost adjacency matrix :

cost of wire per meter * distance matrix
Home1 Home1 Home2 Home3 Home4 0 3720 8680 4960 Home2 3720 0 18600 2480 Home3 8680 18600 0 12400 Home4 4960 2480 12400 0 office 13640 24800 4340 11160

3720

8680 4960 2480

4340

Total cost :2480+3720+4340+8680=19220 MST : (2,4) ,(1,2), (3,5), (1,3)

LINK FAILURE
Link failure between homes 4 and 2 Cost adjacency matrix :

cost of wire per meter * distance matrix

Home1 Home2 Home3 Home4 office

Home1
Home2 Home3 Home4

0
3720 8680 4960

3720
0 18600

8680
18600 0 12400

4960
12400 0

13640
24800 4340 11160

- indicates failure of the link.

2
24800

3720

13640 8680 18600 4960 2480

4340

11160

12400

Node 5 is office

3720

8680 4960

4340

Total cost :3720+4340+4960+8680=21700 MST : (1,2), (3,5), (1,4), (1,3)

CONCLUSION

Kruskals algorithm finds the minimum spanning tree. Helps to find the alternative connections in case of failures.

REFERENCES
1.

2.

3.

Analysis and design of algorithms by A.M Padma Reddy http://www.slideshare.net/Tech_MX/spanningtrees-applications http://www.buildkart.com/finolex-telephone-wiretwo-pair-264