Skip to main content
ADD TO TES PRO

Kruskal's Algorithm Worked Example

Last updated 06 December 2011, created 06 December 2011, viewed 579

A worked example as to how to find the minimum spanning tree using Kruskals algorithm

Downloads and web links

  • for pupils

  • Word documentRevision aid
    Kruskal's Algorithm.doc (126kb, Word document)
Need help viewing resource files?

Classification

Reviews (0)

Please provide a rating.

Add a review
Cancel

Contributed by

phildb"s avatarphildb

Specialist subjects
Mathematics, Psychology
Statistics
This user has contributed 872 resources which have been viewed 310,176 times.
Follow
Most popular resources by this author