Minimum spanning tree

One example of a problem in graphs is the search for trees across. There are two cases that are generally discussed in the search for trees spanning, namely the maximum Spanning Tree and the Minimum Spanning Tree. There are several algorithms that can be used to search for a tree stretching the minimum of a weighted graph or known as the Minimum Spanning Tree (MST) search term. In this study, a Minimum Spanning Tree search was conducted on the PDAM water pipe network in the mendalo asri housing, using the Prim Algorithm. The search is done manually and uses TORA software. The data collection was carried out at the office of PDAM Tirta Muaro Jambi, Jambi Province. From the data obtained can be arranged network images in the form of connected graphs and not directionless and has weight. From the image of the network is then carried out a minimum search Spanning Tree. In this study, it can be known that the Minimum Spanning Tree search uses the Prim Algorithm both manually and with the help of TORA software, showing side selection in the same iteration and producing an MST structure with the same amount of weight also amounting to 5,876 meters. Compared to the initial graph which weighed 7,898 meters, the results of the Minimum Spanning Tree showed a significant difference in pipe weight of 2,022 meters.