Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Add ShortestPaths to Analytics #1

Closed
wants to merge 1 commit into from
Closed

Add ShortestPaths to Analytics #1

Changes from all commits
Commits
Show all changes
1 commit
Select commit
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
41 changes: 41 additions & 0 deletions graphx/src/main/scala/org/apache/spark/graphx/lib/Analytics.scala
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -17,6 +17,8 @@

package org.apache.spark.graphx.lib

import scala.collection.mutable.ArrayBuffer

import org.apache.spark._
import org.apache.spark.graphx._
import org.apache.spark.graphx.PartitionStrategy._
Expand Down Expand Up @@ -146,6 +148,45 @@ object Analytics extends Logging {
}.reduce(_ + _) / 3)
sc.stop()

case "ShortestPaths" =>
var numEPart = 4
var partitionStrategy: Option[PartitionStrategy] = None
val landmarks: ArrayBuffer[VertexId] = ArrayBuffer.empty
var outFname = ""
options.foreach{
case ("numEPart", v) => numEPart = v.toInt
case ("partStrategy", v) => partitionStrategy = Some(pickPartitioner(v))
case ("landmark", v) => landmarks += v.toLong
case ("output", v) => outFname = v
case (opt, _) => throw new IllegalArgumentException("Invalid option: " + opt)
}
println("======================================")
println("| Shortest Paths |")
println("======================================")

if (landmarks.isEmpty) {
println("Specify landmarks by passing --landmark=<VERTEX_ID> one or more times.")
sys.exit(1)
}

val sc = new SparkContext(host, "ShortestPaths(" + fname + ")", conf)
val unpartitionedGraph = GraphLoader.edgeListFile(sc, fname,
minEdgePartitions = numEPart).cache()
val graph = partitionStrategy.foldLeft(unpartitionedGraph)(_.partitionBy(_))
val distances = ShortestPaths.run(graph, landmarks)

if (outFname.nonEmpty) {
println("Writing output in 'vid<TAB>landmark<TAB>distance' format to " + outFname)
distances.vertices.flatMap {
case (vid: VertexId, d: ShortestPaths.SPMap) => d.iterator.map {
case (landmark: VertexId, distance: Int) =>
"%d\t%d\t%d".format(vid, landmark, distance)
}
}.saveAsTextFile(outFname)
}

sc.stop()

case _ =>
println("Invalid task type.")
}
Expand Down