Hi, i'm writing this post because I would to know a caching approach for
iterative algorithms in graphX. So far I was not able to keep stable the
time of execution of each iteration. Can you achieve this condition?
The code I used is this:
var g = ... // my graph
var prevG: Graph[VD, ED] = null
var i = 0
while ( i < maxIter ){
prevG = g
g = g.foo()
g = g.foo1()
g = g.fooN()
g.cache
g.vertices.count + g.edges.count
prevG.edges.unpersist()
prevG.vertices.unpersist()
}
--
View this message in context:
http://apache-spark-user-list.1001560.n3.nabble.com/Caching-in-graphX-tp5482.html
Sent from the Apache Spark User List mailing list archive at Nabble.com.
