spark.examples.JavaTC Maven / Gradle / Ivy

Go to download
package spark.examples;

import scala.Tuple2;
import spark.api.java.JavaPairRDD;
import spark.api.java.JavaSparkContext;
import spark.api.java.function.PairFunction;

import java.util.ArrayList;
import java.util.HashSet;
import java.util.List;
import java.util.Random;
import java.util.Set;

/**
 * Transitive closure on a graph, implemented in Java.
 */
public class JavaTC {

  static int numEdges = 200;
  static int numVertices = 100;
  static Random rand = new Random(42);

  static List> generateGraph() {
    Set> edges = new HashSet>(numEdges);
    while (edges.size() < numEdges) {
      int from = rand.nextInt(numVertices);
      int to = rand.nextInt(numVertices);
      Tuple2 e = new Tuple2(from, to);
      if (from != to) edges.add(e);
    }
    return new ArrayList>(edges);
  }

  static class ProjectFn extends PairFunction>,
      Integer, Integer> {
    static ProjectFn INSTANCE = new ProjectFn();

    public Tuple2 call(Tuple2> triple) {
      return new Tuple2(triple._2()._2(), triple._2()._1());
    }
  }

  public static void main(String[] args) {
    if (args.length == 0) {
      System.err.println("Usage: JavaTC  []");
      System.exit(1);
    }

    JavaSparkContext sc = new JavaSparkContext(args[0], "JavaTC",
        System.getenv("SPARK_HOME"), System.getenv("SPARK_EXAMPLES_JAR"));
    Integer slices = (args.length > 1) ? Integer.parseInt(args[1]): 2;
    JavaPairRDD tc = sc.parallelizePairs(generateGraph(), slices).cache();

    // Linear transitive closure: each round grows paths by one edge,
    // by joining the graph's edges with the already-discovered paths.
    // e.g. join the path (y, z) from the TC with the edge (x, y) from
    // the graph to obtain the path (x, z).

    // Because join() joins on keys, the edges are stored in reversed order.
    JavaPairRDD edges = tc.map(
      new PairFunction, Integer, Integer>() {
        public Tuple2 call(Tuple2 e) {
          return new Tuple2(e._2(), e._1());
        }
    });

    long oldCount = 0;
    long nextCount = tc.count();
    do {
      oldCount = nextCount;
      // Perform the join, obtaining an RDD of (y, (z, x)) pairs,
      // then project the result to obtain the new (x, z) paths.
      tc = tc.union(tc.join(edges).map(ProjectFn.INSTANCE)).distinct().cache();
      nextCount = tc.count();
    } while (nextCount != oldCount);

    System.out.println("TC has " + tc.count() + " edges.");
    System.exit(0);
  }
}