Dijkstra Problem

The aim is to find the route between any two nodes of a network with the least possible total weight.

• Teachers notes (Word document or PDF)
• Topic Introduction Presentation (Powerpoint)
• Student exercise (Word document or PDF) and with alternative labelling (PDF)