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 405e2a2 commit c2445edCopy full SHA for c2445ed
README.md
@@ -22,7 +22,7 @@ To find the shortest path between Alice and David.
22
```py
23
distance = 100/(N+1)
24
25
- Where N = number of time that the user has share something with that user.
+# Where N = number of time that the user has share something with that user.
26
```
27
28
- If distance between 2 users that never shared directly, is less or equal than 40, that user should appears as suggestion.
0 commit comments