Ahh nvm I found the solution :)
triplet.srcAttr != Double.PositiveInfinity && triplet.dstAttr ==
Double.PositiveInfinity
as my new if condition.
-- Forwarded message --
From: Ghufran Malik
Date: 18 April 2014 23:15
Subject: BFS implemented
To: user@spark.apache.org
H
Hi I have sucessfully implemented the Breadth First Search algorithm using
the Pregel operator in graphX as follows:
val graph = GraphLoader.edgeListFile(sc, "graphx/data/test_graph.txt")
val root: VertexId = 1
val initialGraph = graph.mapVertices((id, _) => if (id == root) 0.0 else
Double.Positi
Hi
I was wondering if there was an implementation for Breadth First Search
algorithm in graphX?
Cheers,
Ghufran
