@@ -142,7 +142,7 @@ The following is then executed repeatadly till currentMatching does not change.
* For each such user, among the group of unmatched products it is connected to, pick the `min` (it is better to pick this randomly but then the output is not deterministic and will make testing/debugging difficult)
* It is possible that we have picked the same product two different unmatched users, which would violate the matching constraint.
* In another step, repeat the same process from the products' perspective, i.e., for each product that has been picked as potential match for multiple user nodes, pick the minimum user node (again doing this randomly is better).
* Now we are left with a set of user-product relationships that we can add to currentMatching and iterate
* Now we are left with a set of user-product relationships that we can add to currentMatching and iterate.
### Sample results.txt File
**results.txt** shows the results of running assignment.py on our code using: `$SPARKHOME/bin/spark-submit assignment.py`
