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. www.hegartymaths.com http://www.hegartymaths.com/
Tagged under: Kruskal,Kruskal' algorithm,algorithm,minimum spanning tree,minimum connector problem,graph theory,d1,edexcel,Maths ,Math ,maths online,maths revision,hegartymaths,hegarty maths,math tuition,maths tuition,online math tutor,study math,exam solutions,examsolutions,cool,maths,revision,math ,math tutor,mathematics,free math
Clip makes it super easy to turn any public video into a formative assessment activity in your classroom.
Add multiple choice quizzes, questions and browse hundreds of approved, video lesson ideas for Clip
Make YouTube one of your teaching aids - Works perfectly with lesson micro-teaching plans
1. Students enter a simple code
2. You play the video
3. The students comment
4. You review and reflect
* Whiteboard required for teacher-paced activities
With four apps, each designed around existing classroom activities, Spiral gives you the power to do formative assessment with anything you teach.
Carry out a quickfire formative assessment to see what the whole class is thinking
Create interactive presentations to spark creativity in class
Student teams can create and share collaborative presentations from linked devices
Turn any public video into a live chat with questions and quizzes