An Application of C-language in Solving Minimum Spanning Connectivity of Clustered Cities to the Headquarter City

Abstract

The primary objective of this article is to present a variant minimum spanning problem called “Minimum Spanning Connectivity of Clustered Cities to the Head Quarter City “which is a generalization of problem of Minimum Spanning Tree (MST)and to develop a Lexi-Search Approach(LSA)built on Pattern Recognition Technique(PRT)in order to solve the problem.Lexi Search Algorithms are shown to be dynamic in a large number of combinatorial situations. Here an innovative algorithm called LSA established on PRT has been proposed in order to acquire the optimal solution and the discussions made here are demonstrated by means of numerical examples. Using C- Language the proposed algorithm is designed and it can be observed that this algothim has the ability to execute enormous problems.