Go to content

This lecture from M.I.T. is over an hour long delivered by Prof. Charles Leiserson and covers digraphs, greedy algorithms and minimum spanning trees. It is aimed at undergraduate students.

These lectures will give you some idea of how this subject is treated at university level.

Software/Applets used on this page

Video from MIT
Free lecture notes, exams, and videos are available from Massachusetts Institute of Technology at MIT. No registration required.

This question appears in the following syllabi:

SyllabusModuleSectionTopicExam Year
AQA A-Level (UK - Pre-2017)D1Algorithms on graphsXTRA-
Edexcel A-Level (UK - Pre-2017)D1Algorithms on graphsXTRA-
I.B. Higher Level10Algorithms on graphsXTRA-
OCR A-Level (UK - Pre-2017)D1Algorithms on graphsXTRA-
OCR-MEI A-Level (UK - Pre-2017)D1Algorithms on graphsXTRA-
Universal (all site questions)AAlgorithms on graphsXTRA-
Edexcel AS Further Maths 2017Decision Maths 1ExtraAlgorithms on Graphs - Extra-
AQA AS Further Maths 2017Discrete MathsExtraAlgorithms on Graphs - Extra-
OCR A2 Further Maths 2017Discrete MathsNetwork AlgorithmsNetwork Algorithms - Extra-
OCR MEI AS Further Maths 2017Modelling with AlgorithmsNetwork FlowsNetwork Algorithms - Extra-
Edexcel AS/A2 Further Maths 2017Decision Maths 1ExtraAlgorithms on Graphs - Extra-
AQA AS/A2 Further Maths 2017Discrete MathsExtraAlgorithms on Graphs - Extra-