Kruskal's Algorithm

Description

Minimum spanning tree
Ezra Dorland
Slide Set by Ezra Dorland, updated more than 1 year ago
Ezra Dorland
Created by Ezra Dorland over 7 years ago
26
0

Resource summary

Slide 1

    Caption: : Minimum spanning tree progression
    Minimum spanning tree
    Write down arcs in ascending order of weight Select arc with least weight as start of subtree Only add arcs that do not cause a cycle No need to continue if all vertices are connected through a tree  

Slide 2

    Delightful Definitions!!!
    Subgraph: part of the original graph Vertex: Arc  

Slide 3

    Uses of Kruskal's Algorithm
    Companies use Kruskal's Algorithm in project management. This enables the arcs to be time and the vertexes to be the tasks. 
Show full summary Hide full summary

Similar

Graph Theory
Will Rickard
GCSE Subjects
KimberleyC
The Carbon Cycle - B1
Georgia Freeman
Decision 1
Lucy Denver
KS3 Forces Quiz
Jeffrey Piggott
Carbon Cycle, Eco System, Food chains and communities YEAR 9 GCSE END OF TERM TEST
Sam Manesh
The Water Cycle
Orlagh Bonser
F453 Data Structures - Binary Trees
harvs899
Nitrogen Cycle
James Reston
AQA GCSE Biology genetic variation
Olivia Phillips