Edexcel International AS and A level Further Mathematics XFM01/YFM01 · D1-2.1
Minimum spanning trees: Prim's and Kruskal's algorithms
- Code
- D1-2.1
- In
- D1-2 Algorithms on graphs
- Topic
- D1 Decision Mathematics 1
- Course
- International AS and A level Further Mathematics XFM01/YFM01
- 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-2 Algorithms on graphs
- D1-2.1 Minimum spanning trees: Prim's and Kruskal's algorithms
- D1-2.2 Dijkstra’s algorithm for finding the shortest path