Spanning Trees and Minimum Cost Spanning Trees

1
(No Transcript)
2
Spanning Trees and Minimum Cost Spanning Trees

• Goal Find a minimum cost path WITHOUT
• a circuit.
• Ex. Design routes for ambulance or police car
  to get to an emergency.

3
Kruskals algorithm

• K.A. - add the links of cheapest cost so that
  NO circuits form and so that every vertex
  belongs to some added link
• Note As edges are added, they do not have
  to be connected until the end like the sorted
  edges algorithm

4
Spanning Tree

• Spanning Tree subgraph that contains all
  the vertices of the original
• graph
• Minimum cost spanning tree spanning tree whose
  edges weight sum to a minimum value