Overview

Kruskal's algorithm


Show Summary Details

Quick Reference

A method of finding the minimum-cost spanning tree of a weighted undirected graph, proposed by J. B. Kruskal Jnr (1956).

Subjects: Mathematics.


Reference entries

Users without a subscription are not able to see the full content. Please, subscribe or login to access all content.