二度人脉算法MapReduce实现（工程代码和数据文件）

package org.mapred.social; import java.io.IOException; import org.apache.hadoop.conf.Configuration; import org.apache.hadoop.fs.Path; import org.apache.hadoop.io.Text; import org.apache.hadoop.mapreduce.Job; import org.apache.hadoop.mapreduce.lib.input.FileInputFormat; import org.apache.hadoop.mapreduce.lib.output.FileOutputFormat; import org.apache.hadoop.util.GenericOptionsParser; public class Step1Social2D { public static void main(String[] args) { Configuration conf = new Configuration(); String[] otherArgs = null; try { otherArgs = new GenericOptionsParser(conf, args).getRemainingArgs(); } catch (IOException e) { e.printStackTrace(); } if (otherArgs.length != 2){ System.err.println("Usage: wordcount <in> <out>"); System.exit(2); } Job job = null; try { job = new Job(conf, "Two dimension Social Step One."); job.setJarByClass(Step1Social2D.class); job.setMapperClass(Step1Mapper.class); //job.setCombinerClass(Step1Reducer.class); job.setReducerClass(Step1Reducer.class); job.setMapOutputKeyClass(Text.class); job.setMapOutputValueClass(Text.class); job.setOutputKeyClass(Text.class); job.setOutputValueClass(TextPair.class); FileInputFormat.addInputPath(job, new Path(otherArgs[0])); FileOutputFormat.setOutputPath(job, new Path(otherArgs[1])); System.exit(job.waitForCompletion(true) ? 0 : 1); } catch (Exception e) { e.printStackTrace(); } } }