From e301d54e02d3404fde88c5f4e165e404d4c8e23d Mon Sep 17 00:00:00 2001
From: rtets <rtets@users.noreply.github.com>
Date: Wed, 1 Jun 2016 21:57:41 +0100
Subject: [PATCH] Update assignment3.html

---
 assignment3/assignment3.html | 4 ++--
 1 file changed, 2 insertions(+), 2 deletions(-)

diff --git a/assignment3/assignment3.html b/assignment3/assignment3.html
index 91e747b8..f896c734 100644
--- a/assignment3/assignment3.html
+++ b/assignment3/assignment3.html
@@ -159,7 +159,7 @@ <h2 class="c2"><a name="h.40menlv78i9q"></a><span>Map Input</span></h2>
 
 <h2 class="c2"><a name="h.atam3upnj7wp"></a><span>Reduce Output</span></h2>
 
-<p class="c2"><span>The output should be all pairs (friend, person) such that (person, friend) appears in the dataset but (friend, person) does not.</p>
+<p class="c2"><span>The output should be the full symmetric relation.  For every pair (person, friend), you will emit BOTH (person, friend) AND (friend, person).  However, be aware that (friend, person) may already appear in the dataset, so you may produce duplicates if you are not careful.</p>
 
 <p class="c2"><span>You can test your solution to this problem using friends.json:</span></p>
 
@@ -213,4 +213,4 @@ <h2 class="c2">Reduce Output</h2>
 
 </body>
 
-</html>
\ No newline at end of file
+</html>