基于VB的最小生成树KRUSKAL算法的实现

Implementation of KRUSKAL's Algorithm for Solving Minimum Spanning Tree Based on VB

对求解加权连通无向图最小生成树的KRUSKAL算法进行了探讨,并用VB实现,同时以读取文件的方法输入图,弥补了利用面向过程的程序设计语言在求解最小生成树时输入数据的复杂性。通过可视化的形式显示无向图和最小生成树,使结果直观且容易理解。

This paper discusses the KRUSKAL＇s algorithm for solving the minimum spanning tree of an undirected connected weighted graph,implements it through VB programming language,and inputs the graph with data files,which overcomes the complexity of inputting data which arise from using the procedure-oriented programming language when solving the minimum spanning tree.This paper displays the graph and the minimum spanning tree by means of visualization to make the result visualized and understandable.