Title of article
Minimum Spanning Tree Algorithm
Author/Authors
Vikas.C.S، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2010
Pages
7
From page
38
To page
44
Abstract
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 Categories and Subject Descriptors Algorithm C.4 (Data Structures) General Terms 1. Algorithm.
Keywords
Graph: It is a collection of nodes. It mainly consists of two elements –vertices and edges. Vertex: It is simply drawn as a node or dot. Edge: It is a line connecting two vertices. Degree: It is the total number of edges incident on a vertex
Journal title
International Journal of Computer Applications
Serial Year
2010
Journal title
International Journal of Computer Applications
Record number
659401
Link To Document