{"id":181,"date":"2013-04-02T12:24:21","date_gmt":"2013-04-02T12:24:21","guid":{"rendered":"http:\/\/mathedup.dreamhosters.com\/?page_id=181"},"modified":"2016-01-14T00:09:17","modified_gmt":"2016-01-13T23:09:17","slug":"shortest-path","status":"publish","type":"page","link":"https:\/\/www.mathedup.co.uk\/key-stage-5\/applied-maths\/decision-1\/shortest-path\/","title":{"rendered":"Shortest path"},"content":{"rendered":"

Dijkstra’s starter<\/a> – Put in a plastic wallet and use whiteboard pens. As students to find the shortest distance between any 2 places. Use as a discussion point for why an algorithm may be needed.<\/p>\n

Dijkstra’s algorithm 1<\/a> – Smart Notebook<\/p>\n