README

README.md

@@ -1,13 +1,14 @@
 # Paths in a Graph from A to B
 
-Hi, this is an app, but you can interpret it as a service. Its service is to find all paths in a connected graph com node A to B.
+Hi, this is an app, but you can interpret it as a service. Its duty is to find all paths in a connected graph com node A to B.
 
-Premisse: There is ALWAYS at least one path from A to B. 
+## Preamble
 
-The natural extension to this service are:
+For a beginner, a graph is a bunch of dots connected by either undirected lines or directed arrows. Take a look at the following URL: https://adrianmejia.com/data-structures-for-beginners-graphs-time-complexity-tutorial/
 
-1) How far one can reach from one node;
-2) return empty array in case there is no path feasible.
+*Premisse*: There is ALWAYS at least one path from A to B. (Improvement required)
+
+## How to run
 
 You may utilize some cloud service to host the app, like AWS, Azure or GCloud, but in this case you might run locally.
 You must follow the instructions below
@@ -19,4 +20,12 @@ You must follow the instructions below
 5) Type `localhost:8080` on the URL field;
 6) See the possible paths from node 2 to 3.
 
+## Backlog
+
+New features to this service are:
+
+[:priority]: :explanation
 
+1) [  High  ]: Allow to identify cyclic paths;
+2) [ Medium ]: Given a node, which nodes it can reach;
+3) [ Medium ]: Return empty array in case there is no path feasible to B;