This GeoGebra companion maps directly to all chapters of the Cambridge Decision Mathematics 1 Student Book. Each chapter contains short, interactive investigations that mirror the textbook topics so students can explore algorithms, visualise networks, test optimisation methods, and model decision processes dynamically.
[b]Algorithms [/b]— flowchart builders, visual step-throughs of bubble/quick sort, bin-packing simulators, and binary search animations.
[b]Graphs and networks [/b]— drag-and-drop graph constructors, special graph type explorers, and matrix-based graph representations.
[b]Algorithms on graphs[/b] — interactive Kruskal’s and Prim’s algorithms with edge-weight sliders, shortest-path finders using Dijkstra’s, and nearest-neighbour tours.
[b]Route inspection[/b] — Eulerian path visualisations, parity checkers, and dynamic application of the route inspection algorithm.
[b]The travelling salesman problem [/b]— upper and lower bound explorers, spanning tree demonstrations, and nearest-neighbour tours that update dynamically.
[b]Critical path analysis[/b] — project-modelling diagrams, dummy activities, early/late event calculators, float and critical activity visualisations, plus editable Gantt charts and scheduling diagrams.
[b]Linear programming[/b] — constraint-region graphers, optimal point locators, and integer-solution checkers with real-time optimisation sliders.
