The Realization and Analysis of Kruskal's Algorithm Based on Greedy Policy

Feng Hui-ling · Computer Knowledge and Technology · 2009

The Greedy Policy is used in constructing the minimum-cost spanning tree of the graph. The paper aims to introduce the approach to realization of Kruskal's Algorithm and makes an analysis of its efficiency.

Read the paper · More papers on PaperTik