UCSY's Research Repository

Implementation of Shortest Path Finding System by Using Kruskal Algorithm

Show simple item record

dc.contributor.author Aung, Htike Htet
dc.contributor.author Zaw, Win Win
dc.date.accessioned 2019-08-02T04:19:19Z
dc.date.available 2019-08-02T04:19:19Z
dc.date.issued 2009-08-03
dc.identifier.uri http://onlineresource.ucsy.edu.mm/handle/123456789/1605
dc.description.abstract Graphs have been used in a wide variety of application. Some of these applications are analysis of electrical circuits, finding shortest routes, project planning, and identification of chemical compounds, statistical mechanics, genetics, and social sciences and so on. Indeed, it might be well said that of all mathematical structures, graphs are the most widely used. This paper is intended to study how a graph theory applied to find shortest path by using a minimum spanning tree. In this study, it is implemented popular locations of the Mandalay City as the vertices of an undirected graph. In this system, the associated distances between each location are presented as weights of the edges of the graph. There are three different algorithms to obtain a minimum –cost spanning of a connected, undirected graph. Our shortest path finding system is focused on Kruskal Algorithm. en_US
dc.language.iso en en_US
dc.publisher Third Local Conference on Parallel and Soft Computing en_US
dc.title Implementation of Shortest Path Finding System by Using Kruskal Algorithm en_US
dc.type Article en_US

Files in this item

This item appears in the following Collection(s)

Show simple item record

Search Repository


My Account