org.sf.xrime.algorithms.partitions.connected.strongly.BackwardTrimPartA.java Source code

Introduction

Here is the source code for org.sf.xrime.algorithms.partitions.connected.strongly.BackwardTrimPartA.java

Source

/*
 * Copyright (C) IBM Corp. 2009.
 * 
 * Licensed under the Apache License, Version 2.0 (the "License"); you may not
 * use this file except in compliance with the License. You may obtain a copy of
 * the License at
 * 
 * http://www.apache.org/licenses/LICENSE-2.0
 * 
 * Unless required by applicable law or agreed to in writing, software
 * distributed under the License is distributed on an "AS IS" BASIS, WITHOUT
 * WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. See the
 * License for the specific language governing permissions and limitations under
 * the License.
 */
package org.sf.xrime.algorithms.partitions.connected.strongly;

import java.io.IOException;

import org.apache.hadoop.io.Text;
import org.apache.hadoop.mapred.FileInputFormat;
import org.apache.hadoop.mapred.FileOutputFormat;
import org.apache.hadoop.mapred.JobClient;
import org.apache.hadoop.mapred.JobConf;
import org.apache.hadoop.mapred.Mapper;
import org.apache.hadoop.mapred.OutputCollector;
import org.apache.hadoop.mapred.Reporter;
import org.apache.hadoop.mapred.SequenceFileInputFormat;
import org.apache.hadoop.mapred.SequenceFileOutputFormat;
import org.sf.xrime.ProcessorExecutionException;
import org.sf.xrime.algorithms.GraphAlgorithm;
import org.sf.xrime.algorithms.utils.GraphAlgorithmMapReduceBase;
import org.sf.xrime.model.vertex.LabeledAdjBiSetVertex;

/**
 * The backward trim is to trim vertexes which have no descendants. This class is used to emit
 * those vertexes for backup purpose.
 * @author xue
 *
 */
public class BackwardTrimPartA extends GraphAlgorithm {
    /**
     * Default constructor.
     */
    public BackwardTrimPartA() {
        super();
    }

    /**
     * Mapper
     * @author xue
     */
    public static class MapClass extends GraphAlgorithmMapReduceBase
            implements Mapper<Text, LabeledAdjBiSetVertex, Text, LabeledAdjBiSetVertex> {

        @Override
        public void map(Text key, LabeledAdjBiSetVertex value, OutputCollector<Text, LabeledAdjBiSetVertex> output,
                Reporter reporter) throws IOException {
            if (value.getForwardVertexes() == null || value.getForwardVertexes().size() == 0) {
                // Clear to reduce I/O overhead.
                value.clearBackwardVertex();
                value.clearForwardVertex();
                value.clearLabels();
                // This vertex has no descendants.
                value.setStringLabel(ConstantLabels.FINAL_LABEL, value.getId());
                output.collect(key, value);
            }
        }
    }

    @Override
    public void execute() throws ProcessorExecutionException {
        JobConf conf = new JobConf(context, BackwardTrimPartA.class);
        conf.setJobName("BackwardTrimPartA");

        // the keys are vertex identifiers (strings)
        conf.setOutputKeyClass(Text.class);
        // the values are vertexes (Writable)
        conf.setOutputValueClass(LabeledAdjBiSetVertex.class);
        conf.setMapperClass(MapClass.class);
        // No combiners, no reducers.
        // makes the file format suitable for machine processing.
        conf.setInputFormat(SequenceFileInputFormat.class);
        conf.setOutputFormat(SequenceFileOutputFormat.class);
        try {
            FileInputFormat.setInputPaths(conf, getSource().getPath());
            FileOutputFormat.setOutputPath(conf, getDestination().getPath());
        } catch (IllegalAccessException e1) {
            throw new ProcessorExecutionException(e1);
        }
        conf.setNumMapTasks(getMapperNum());
        conf.setNumReduceTasks(0);

        try {
            this.runningJob = JobClient.runJob(conf);
        } catch (IOException e) {
            throw new ProcessorExecutionException(e);
        }
    }
}