OCR A Level Further Mathematics B (MEI) H645 · Y433/AN3
Networks as weighted graphs
- Code
- Y433/AN3
- In
- Y433.2 Modelling with algorithms: networks
- Topic
- Y433 Modelling with Algorithms
- Course
- A Level Further Mathematics B (MEI) H645
- Board
- OCR
Grade boundaries·OCR command words
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 Y433.2 Modelling with algorithms: networks
- Y433/AN1 Graphs and their language
- Y433/AN2 Modelling with graphs
- Y433/AN3 Networks as weighted graphs
- Y433/AN4 Modelling with networks
- Y433/AN5 Kruskal's and Prim's algorithms
- Y433/AN6 Dijkstra's algorithm
- Y433/AN7 Complexity of network algorithms
- Y433/AN8 Activity-on-arc networks
- Y433/AN9 Critical path analysis
- Y433/AN10 Networks as transmission systems
- Y433/AN11 Cuts and their capacity
- Y433/AN12 Maximum flow/minimum cut theorem
- Y433/AN13 Exploring network algorithms with software