2010•Computer Knowledge and TechnologyRequires access

Construction of Minimum Cost Spanning Tree on Kruskal Algorithm

Kun Huang

Abstract

The minimum Cost spanning tree data structure is an important application of Chinese, in the picture for n vertex even Tong Wang can create many different spanning tree, minimum cast spanning tree is in all spanning tree in the total cost of the minimum spanning tree. Kruskal algorithm adopt the adjacency matrix as the storage structure, it to the Minimum Cost Spanning Tree is the most common type of an algorithm.

About this research paper

What this paper is about

Why it matters

A significance statement is not available in the OpenAlex record.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

Key concepts: Kruskal's algorithm, Minimum spanning tree, Spanning tree, Distributed minimum spanning tree, Prim's algorithm, Reverse-delete algorithm, Computer science, Connected dominating set