Graph java 实现最小生成树

算法简单描述为

1：创建一个空图。

2：把边最短的边加到图中。在选择最短边时，已经加入的不能加，边src和dst边是一个component的不能加。加入到图中的边需要打上标记。

3：循环2

代码如下

import java.io.Serializable;
import java.util.Arrays;
import java.util.Comparator;


import org.apache.spark.SparkConf;
import org.apache.spark.api.java.JavaPairRDD;
import org.apache.spark.api.java.JavaRDD;
import org.apache.spark.api.java.JavaSparkContext;
import org.apache.spark.api.java.function.PairFunction;
import org.apache.spark.api.java.function.VoidFunction;
import org.apache.spark.graphx.Edge;
import org.apache.spark.graphx.EdgeTriplet;
import org.apache.spark.graphx.Graph;
import org.apache.spark.graphx.Graph$;
import org.apache.spark.graphx.VertexRDD;
import org.apache.spark.rdd.RDD;
import org.apache.spark.storage.StorageLevel;


import com.google.common.base.Optional;


import scala.Function1;
import scala.Option;
import scala.Tuple2;
import scala.reflect.ClassManifestFactory;
import scala.reflect.ClassTag;
import scala.runtime.AbstractFunction0;
import scala.runtime.AbstractFunction1;
import scala.runtime.AbstractFunction2;
import scala.runtime.AbstractFunction3;
import scala.runtime.BoxedUnit;


/**
 * @param <T>
 * 
 */


public class MiniTreeTest
{


private static final ClassTag<Integer> tagInteger = ClassManifestFactory.classType( Integer.class );
private static final ClassTag<String> tagString = ClassManifestFactory.classType( String.class );
private static final ClassTag<Object> tagObject = ClassManifestFactory.classType( Object.class );
private static final ClassTag<Double> tagDouble = ClassManifestFactory.classType( Double.class );
private static final ClassTag<Tuple2<Object, Double>> tagTuple2 = ClassManifestFactory.classType( Tuple2.class );
private static final ClassTag<Tuple2<Boolean, Double>> tagTuple2Boolean = ClassManifestFactory.classType( Tuple2.class );


public static void main( String[] args )
{
SparkConf conf = new SparkConf( ).setAppName( "Graph short path" ).setMaster( "local" );
JavaSparkContext ctx = new JavaSparkContext( conf );


JavaRDD<Tuple2<Object, String>> verts = ctx.parallelize( Arrays.asList( 
new Tuple2<Object, String>( 1L, "a" ),
new Tuple2<Object, String>( 2L, "b" ), 
new Tuple2<Object, String>( 3L, "c" ), 
new Tuple2<Object, String>( 4L, "d" ), 
new Tuple2<Object, String>( 5L, "e" ) ) );


JavaRDD<Edge<Double>> edges = ctx.parallelize( Arrays.asList( 
new Edge<Double>( 1L, 2L, 10.0 ), 
new Edge<Double>( 2L, 3L, 20.0 ),
new Edge<Double>( 2L, 4L, 30.0 ), 
new Edge<Double>( 4L, 5L, 80.0 ), 
new Edge<Double>( 1L, 5L, 3.0 ), 
new Edge<Double>( 1L, 4L, 30.0 ) ) );


Graph<String, Double> g = Graph.apply( verts.rdd( ), edges.rdd( ), "aa", StorageLevel.MEMORY_ONLY( ), StorageLevel.MEMORY_ONLY( ), tagString, tagDouble );


Graph<String, Double> retGraph = minSpanningTree( g );


retGraph.edges( ).foreach( new MyFuction1<Edge<Double>, BoxedUnit>( )