Shortest paths¶
Goal and organization¶
The objective of this second workshop is to write a program to
compute the shortest paths between stations in Parisian subway.
To reach this goal, you will have to follow the instructions found at
To help you, you must first
read the lecture notes (see below) on the shortest path problem and Dijkstra’s algorithm;
then do the exercises “on paper”.
As for the previous workshop, you must work in groups of 4 students and register your answers in a report. To do this, you must
create one google doc per team;
share it with the other team members; and
share it with the teacher at the beginning of the session.