Algorithms on graphs - Paper 3D: Decision Mathematics 1 — Edexcel A-Level Mathematics
Test yourself on Algorithms on graphs - Paper 3D: Decision Mathematics 1 with PEARSON EDEXCEL A-Level practice questions.
Start free
7 days Premium · Then the free plan continues · No card, no charge
Your focus
- 2.1 The minimum spanning tree (minimum connector) problem. Prim’s and Kruskal’s algorithm.