Hi there, I am working in a group of the University of Michigan, and we are trying to make (and find first) some Distributed graph algorithms.
I know spark, and I found GraphX. I read the docs, but I only found Latent Dirichlet Allocation algorithms working with GraphX, so I was wondering why ? Basically, the groupe wants to implement Minimal Spanning Tree, kNN, shortest path at first. So my askings are : Is graphX enough stable for developing this kind of algorithms on it ? Do you know some algorithms like these working on top of GraphX ? And if no, why do you think, nobody tried to do it ? Is this too hard ? Or just because nobody needs it ? Maybe, it is only my knowledge about GraphX which is weak, and it is not possible to make these algorithms with GraphX. Thanking you in advance, Best regards, Thibaut -- View this message in context: http://apache-spark-developers-list.1001551.n3.nabble.com/GRAPHX-Graph-Algorithms-and-Spark-tp17301.html Sent from the Apache Spark Developers List mailing list archive at Nabble.com. --------------------------------------------------------------------- To unsubscribe, e-mail: dev-unsubscr...@spark.apache.org For additional commands, e-mail: dev-h...@spark.apache.org
