Open AccessMinimum Spanning Tree Algorithm
Author(s) -
Cholleti Vikas
Publication year - 2010
Publication title -
international journal of computer applications
Language(s) - English
Resource type - Journals
ISSN - 0975-8887
DOI - 10.5120/185-321
Subject(s) - computer science , minimum spanning tree , spanning tree , kruskal's algorithm , distributed minimum spanning tree , prim's algorithm , tree (set theory) , algorithm , discrete mathematics , combinatorics , mathematics
An algorithm for minimum spanning tree is discussed here. Apart from the traditional Kruskal’s and Prim’s algorithm for finding the minimum spanning tree, yet another algorithm for the same purpose is described here. Initially we form a forest and then we convert the forest into the minimum spanning tree
Accelerating Research
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom
Address
John Eccles HouseRobert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom