From 9644bd3158e7392b2353a019e8acd24d9102c59a Mon Sep 17 00:00:00 2001 From: rui Date: Fri, 7 Feb 2020 18:19:08 +0100 Subject: [PATCH] Delete uneeded file --- Instructions.txt | 17 ----------------- 1 file changed, 17 deletions(-) delete mode 100644 Instructions.txt diff --git a/Instructions.txt b/Instructions.txt deleted file mode 100644 index 65bebd6..0000000 --- a/Instructions.txt +++ /dev/null @@ -1,17 +0,0 @@ -# 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 \ No newline at end of file