spark graphX 最短路径 打印路径（中间节点）

import org.apache.spark.graphx.util.GraphGenerators
import org.apache.spark.graphx.{EdgeDirection, Graph, VertexId}
import org.apache.spark.{SparkConf, SparkContext}

object SSSPTest {
  def main(args: Array[String]) {
    val conf = new SparkConf().setAppName("SSSPTest").setMaster("local[*]")
    val sc = new SparkContext(conf)
    // A graph with edge attributes containing distances
    val graph: Graph[Long, Double] =
      GraphGenerators.logNormalGraph(sc, numVertices = 5).mapEdges(e => e.attr.toDouble)
    graph.edges.foreach(println)
    val sourceId: VertexId = 0 // The ultimate source

    // Initialize the graph such that all vertices except the root have distance infinity.
    val initialGraph: Graph[(Double, List[VertexId]), Double] = graph.mapVertices((id, _) =>
      if (id == sourceId) (0.0, List[VertexId](sourceId))
      else (Double.PositiveInfinity, List[VertexId]()))

    val sssp = initialGraph.pregel((Double.PositiveInfinity, List[VertexId]()), Int.MaxValue, EdgeDirection.Out)(

      // Vertex Program
      (id, dist, newDist) => if (dist._1 < newDist._1) dist else newDist,

      // Send Message
      triplet => {
        if (triplet.srcAttr._1 < triplet.dstAttr._1 - triplet.attr) {
          Iterator((triplet.dstId, (triplet.srcAttr._1 + triplet.attr, triplet.srcAttr._2 :+ triplet.dstId)))
        } else {
          Iterator.empty
        }
      },
      //Merge Message
      (a, b) => if (a._1 < b._1) a else b)

    //spark graphX求最短路径以及中间结点
    //(0,(0.0,List(0)))
    //(1,(2.0,List(0, 3, 1)))
    //(2,(2.0,List(0, 3, 2)))
    //(3,(1.0,List(0, 3)))
    //(4,(2.0,List(0, 3, 4)))
    println(sssp.vertices.collect.mkString("\n"))
  }
}

防止忘记。