I am new to java and hadoop and trying to complete a homework question.
Do you have a tutorial I could follow? Or a suggestion on how to get the expected output? All the tutorials i am seeing are summing the values and writing a key and result (https://hadoop.apache.org/docs/current/hadoop-mapreduce-client/hadoop-mapreduce-client-core/MapReduceTutorial.html#Example:_WordCount_v1.0). However I need to do something slightly different.
I need to return the src, the tgt with the highest weight, and the weight (i believe this is a tuple of (tgt, weight). In the event of a tie, return the tgt with the lowest number - that's why the output for bob is "bob 70,3"
Recently Asked Questions
- Please refer to the attachment to answer this question. This question was created from Lab5.pdf.
- 11. A priority queue is implemented heap: Show how this heap would look after the following series of operations Pq.enqueue(28): Pq.enqueuel2): q.enqueue(40):
- use the following values: 66, 47, 87, 90, 126, 140, 145, 153, 177, 285, 393, 395, 467, 566, 620, 735 42. Store the values into a hash table with 20 positions,