Fuzzy Shortest Route Algorithm for Telephone Line Connection Using Matrix Algorithm

In computer science, there are many algorithms that finds a minimum spanning tree for a connected weighted undirected fuzzy graph. The minimum length (or cost) spanning tree problem is one of the nicest and simplest problems in network optimization, and it has a wide variety of applications. The problem is to find a minimum cost (or length) spanning tree in G. Applications include the design of various types of distribution networks in which the nodes represent cities, centers etc. , and edges represent communication links (fiber glass phone lines, data transmission lines, cable TV lines, etc. ), high voltage power transmission lines, natural gas or crude oil pipelines, water pipelines, highways, etc. The objective is to design a network that connects all the nodes using the minimum length of cable or pipe or other resource. . in this paper we find the solution to the problem is to minimize the amount of new telephone line connection using matrix algorithm with fuzzy graph.