Hi All, I am wondering what is the best way to remove transitive edges with maximum spanning tree. For example,
Edges: 1 -> 2 (30) 2 -> 3 (30) 1 -> 3 (25) where parenthesis is a weight for each edge. Then, I'd like to get the reduced edges graph after "Transitive Reduction" with considering the weight as a maximum spanning tree. Edges: 1 -> 2 (30) 2 -> 3 (30) Do you have a good idea for this? Thanks, Ted -- View this message in context: http://apache-spark-user-list.1001560.n3.nabble.com/Spark-GraphX-question-tp20768.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
