USING MINIMUM SPANNING TREE TO REDUCE COST OF THE CABLE FOR THE INTERNET

Abstract

Companies always look for ways to be effective and efficient in their business. They seek techniques for maximizing profit and minimizing costs in order to function well and also having a technique that they can rely on when estimating the best way to minimize wastage can assist them to be objective in their endeavors. Therefore, installing internet cable should not be a trial-and-error technique rather an object-oriented method. The aim of this study is to undertake the functioning of the internet of the company and find methods in which it becomes cost effective. Installing cable can be costly especially when there is no mechanism to minimize wastages. This study seeks to establish whether Kruskal can be a reliable method to reduce the cost of installation and maximize profit. The methodology of this study includes using a minimum spanning tree using Kruskal’s Algorithm. Kruskal method is a graphical method that focuses on selecting minimum length between two houses progressively until an optimum route is established. The finding showed that using Kruskal algorithm the size of the cable used can be managed adequately to reduce cost and maximize profit. This study concluded that using the Kruskal method companies can reduce the overall cost of installing cable since it assists in establishing the minimum route.