OCR AS Level Further Mathematics B (MEI) H635 · Y413/MN6
Dijkstra's algorithm
- Code
- Y413/MN6
- In
- Y413.2 Modelling with algorithms: networks
- Topic
- Y413 Modelling with Algorithms
- Course
- AS Level Further Mathematics B (MEI) H635
- Board
- OCR
Codes and titles are read by a script from OCR's published specification and have not been checked by a person. What each point covers is in the specification itself: OCR’s specification.
Points in Y413.2 Modelling with algorithms: networks
- Y413/MN1 Graphs and their language
- Y413/MN2 Modelling with graphs
- Y413/MN3 Networks as weighted graphs
- Y413/MN4 Modelling with networks
- Y413/MN5 Kruskal's and Prim's algorithms
- Y413/MN6 Dijkstra's algorithm
- Y413/MN7 Complexity of network algorithms
- Y413/MN8 Activity-on-arc networks
- Y413/MN9 Critical path analysis
- Y413/MN10 Networks as transmission systems
- Y413/MN11 Cuts and their capacity
- Y413/MN12 Maximum flow/minimum cut theorem
- Y413/MN13 Exploring network algorithms with software