← Back to VOLUME 3, ISSUE 11, NOVEMBER 2016
This work is licensed under a Creative Commons Attribution 4.0 International License.
ALGORITHM TO FIND MINIMUM WEIGHT SPANNING TREE DYNAMICALLY
👁 4 views📥 0 downloads
Abstract: A minimum spanning tree is a spanning tree of a connected undirected graph. Each edge is labelled with its weight. It connects all the vertices together with the minimal total weight for its edges. In this paper we designed an algorithm to find minimum weight spanning tree.
Keywords: Spanning tree, minimum spanning tree, minimum weight.
How to Cite:
[1] Ishwar Baidari, S.P. Sajjan, “ALGORITHM TO FIND MINIMUM WEIGHT SPANNING TREE DYNAMICALLY,” International Advanced Research Journal in Science, Engineering and Technology (IARJSET), DOI: 10.17148/IARJSET.2016.31131
This work is licensed under a Creative Commons Attribution 4.0 International License.