# Kruskal's Alorithm (Tutorial 8) D1 EDEXCEL A-Level

This is a tutorial on Kruskal's Algorithm - (Tutorial 7) D1 EDEXCEL A-Level. It shows how to solve the minimum connector problem by finding a minimal spanning tree of a graph. Make notes while watching the video and attempt the practice questions suggested in the video and in the D1 book. Then move on to Kruskal's Algorithm - Matrices (Exam Qs 8) D1 EDEXCEL A-Level to practise what you have learnt in exam questions.

- Created by: Mr Hegarty
- Created on: 25-06-12 18:29

## Similar Mathematics resources:

Teacher recommended

## Comments

No comments have yet been made