International Journal of Science and Research (IJSR)

International Journal of Science and Research (IJSR)
Call for Papers | Fully Refereed | Open Access | Double Blind Peer Reviewed

ISSN: 2319-7064

Downloads: 123 | Views: 197 | Weekly Hits: ⮙2 | Monthly Hits: ⮙2

Research Paper | Mathematics | Indonesia | Volume 4 Issue 12, December 2015 | Rating: 6.6 / 10

Minimum Spanning Tree Determination Program Using Kruskal Algorithm on Visual Basic 6.0

Nina Zakiah | Desniarti | Benny Sofyan Samosir

Abstract: Minimum spanning tree has been used to solve several problem, such as cost saving in electrical installation. Electrical instalation design is described in weighted graph form. the weighted graph value is a cable length. to find a minimum spanning tree in this research, the Kruskal algorithm is used. Kruskal algorithm Procedure will be describe in a flow chart. then according to the flowchart, a program designed with visual basic 6.0. this research will produce a program to solve minimum spanning tree with the Kruskal algorithm on visual basic 6.0 application support. test the program to solve one of problems. This application is divided many form such as menu form, description form, input form, and matrix and tree form.

Keywords: Minimum Spanning Tree, Kruskals Algorithm, Microsoft Visual Basic 60

Edition: Volume 4 Issue 12, December 2015,

Pages: 1817 - 1821

How to Download this Article?

Type Your Valid Email Address below to Receive the Article PDF Link

Verification Code will appear in 2 Seconds ... Wait