Finding Minimum Spanning Tree

Abstract

This paper studies the Minimum Spanning Tree Methods. A graph is a collection of nodes and edges, but has no rules dictating the connection among the nodes. All trees are graphs. A tree is a special case of graph in which all nodes are reachable from some starting node and one that has no cycles. There are typically many spanning tree in an undirected graph such that the sum of the lengths of tree’s edges is as small as possible by using Kruskal’s Algorithm, Prim’s Algorithm and Genetic Algorithm, This system is implemented by using Microsoft Visual Studio C#2008.