"False" if it has the intersection, but
lower weight.
4. Remove all "False" edges using subgraph.
But I am sure GraphX developer might have a better scalable and succinct
idea for this problem.
Thanks,
Ted
--
View this message in context:
http://apache-spark-user-list.1001
Thanks,
>
> Ted
>
>
> --
> If you reply to this email, your message will be added to the discussion
> below:
>
> http://apache-spark-user-list.1001560.n3.nabble.com/Spark-GraphX-question-tp20768.html
> To start a new topic under Apache Spark
n"
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
