updated

Author: metantonio

Figure_1.png

@@ -8,4 +8,19 @@ poetry install
 
 ```sh
 poetry run python ./social.py
-```
+```
+
+To find the shortest path between Alice and David.
+
+<img src="./Figure_1.png"></img>
+
+Next exercise proposition:
+
+- Imagine every person starts with a distance of 100 between them.
+- Every time that a person share somethin with anyone, the distance between them is reduced by:
+    distance = 100/(N+1)
+
+    Where N = number of time that the user has share something with that user.
+
+- If distance between 2 users that never shared directly, is less than 40, that user should appears as suggestion.
+- If distance between 2 users that never shared directly, is less than 10, that user should appear as recommendation as friend.

README.md

@@ -55,10 +55,11 @@ def draw_graph(graph, shortest_paths, start_node, end_node):
 
 # Definimos el grafo que representa la red social
 graph = {
-    'Alice': {'Bob': 5, 'Charlie': 2},
+    'Alice': {'Bob': 5, 'Charlie': 2, 'Jhon':1.5},
     'Bob': {'Alice': 5, 'David': 3},
     'Charlie': {'Alice': 2, 'David': 7},
-    'David': {'Bob': 3, 'Charlie': 7}
+    'David': {'Bob': 3, 'Charlie': 7},
+    'Jhon': {'Alice':1.5}
 }
 
 # Especificamos los nodos de inicio y fin para encontrar la distancia más corta entre ellos