Edexcel International AS and A level Mathematics XMA01/YMA01 · D1-3.3
Determination of upper and lower bounds using minimum spanning tree methods
- Code
- D1-3.3
- In
- D1-3 Algorithms on graphs II
- Topic
- D1 Decision Mathematics 1
- Course
- International AS and A level Mathematics XMA01/YMA01
- Board
- Edexcel
Grade boundaries·Edexcel command words
Codes and titles are read by a script from Edexcel's published specification and have not been checked by a person. What each point covers is in the specification itself: Edexcel’s specification.
Points in D1-3 Algorithms on graphs II
- D1-3.1 Route inspection algorithm
- D1-3.2 Travelling salesman problems
- D1-3.3 Determination of upper and lower bounds using minimum spanning tree methods
- D1-3.4 The nearest neighbour algorithm