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

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:

Syllabus | Module | Section | Topic | Exam Year |
---|---|---|---|---|

AQA A-Level (UK - Pre-2017) | D1 | Algorithms on graphs | XTRA | - |

AQA AS Further Maths 2017 | Discrete Maths | Extra | Algorithms on Graphs - Extra | - |

AQA AS/A2 Further Maths 2017 | Discrete Maths | Extra | Algorithms on Graphs - Extra | - |

Edexcel A-Level (UK - Pre-2017) | D1 | Algorithms on graphs | XTRA | - |

Edexcel AS Further Maths 2017 | Decision Maths 1 | Extra | Algorithms on Graphs - Extra | - |

Edexcel AS/A2 Further Maths 2017 | Decision Maths 1 | Extra | Algorithms on Graphs - Extra | - |

I.B. Higher Level | 10 | Algorithms on graphs | XTRA | - |

OCR A-Level (UK - Pre-2017) | D1 | Algorithms on graphs | XTRA | - |

OCR A2 Further Maths 2017 | Discrete Maths | Network Algorithms | Network Algorithms - Extra | - |

OCR MEI AS Further Maths 2017 | Modelling with Algorithms | Network Flows | Network Algorithms - Extra | - |

OCR-MEI A-Level (UK - Pre-2017) | D1 | Algorithms on graphs | XTRA | - |

Universal (all site questions) | A | Algorithms on graphs | XTRA | - |