Hi everyone, I'm looking to implement Markov algorithms in GraphX and I'm wondering if it's already possible to auto-convert the Graph into a Sparse Double Matrix? I've seen this implemented in other graphs before, namely JUNG, but still familiarizing myself with GraphX. Example: https://code.google.com/p/jung/source/browse/branches/guava/jung/jung-algorithms/src/main/java/edu/uci/ics/jung/algorithms/matrix/GraphMatrixOperations.java#181
This is specifically for doing operations such as Mean First Passage Time calculations. If it doesn't yet exist, are the Matrices implemented in MLLib going to be enough for this? Or will I need to go the way of Breeze or Colt? Thanks! -- View this message in context: http://apache-spark-user-list.1001560.n3.nabble.com/Convert-GraphX-Graph-to-Sparse-Matrix-tp14303.html Sent from the Apache Spark User List mailing list archive at Nabble.com. --------------------------------------------------------------------- To unsubscribe, e-mail: user-unsubscr...@spark.apache.org For additional commands, e-mail: user-h...@spark.apache.org