We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
There was an error while loading. Please reload this page.
1 parent 10a9433 commit d3c256aCopy full SHA for d3c256a
README.md
@@ -17,7 +17,7 @@ To find the shortest path between Alice and David.
17
# Exercise proposition:
18
19
- Imagine every person starts with a distance of 100 between them.
20
-- Every time that a person share somethin with anyone, the distance between them is reduced by:
+- Every time that a person have an interaction with another, the distance between them is reduced by:
21
distance = 100/(N+1)
22
23
Where N = number of time that the user has share something with that user.
0 commit comments