17 lines
757 B
Plaintext
17 lines
757 B
Plaintext
# start
|
|
|
|
By creating a new web app that you will call Dijkstra, I would like you to:
|
|
|
|
- Find a DB modelization that allows you to store any country given its cities and its roads between them (see Belgian graph);
|
|
|
|
- Store the Belgian data (see belgium.rb);
|
|
|
|
- Allow a user to select Belgium as a country (or if he/she navigates to /countries/belgium), then allow to select a starting point (a Belgian city) and a destination (also a Belgian city);
|
|
|
|
- Once the user has selected the starting point and the destination, tell the shortest distance between those two cities;
|
|
|
|
- Describe to the user the path (for example: Bruges -> Ghent -> Brussels -> Liège) that corresponds to the shortest distance you returned to the user;
|
|
|
|
- Make your code shines!
|
|
|
|
# end |