Edexcel International AS and A level Mathematics XMA01/YMA01 · D1-2

Algorithms on graphs

Code: D1-2
In: D1 Decision Mathematics 1
Course: International AS and A level Mathematics XMA01/YMA01
Board: Edexcel

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 under D1-2

D1-2.1 Minimum spanning trees: Prim's and Kruskal's algorithms
D1-2.2 Dijkstra’s algorithm for finding the shortest path

Points in D1 Decision Mathematics 1

D1-1 Algorithms
D1-2 Algorithms on graphs
D1-3 Algorithms on graphs II
D1-4 Critical path analysis
D1-5 Linear programming