-
Notifications
You must be signed in to change notification settings - Fork 28.3k
New issue
Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.
By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.
Already on GitHub? Sign in to your account
[SPARK-7984][Graphx]Complex Operators between Graphs: Union #6685
Conversation
cc @ankurdave |
ok to test |
Test build #35186 has finished for PR 6685 at commit
|
Test build #35264 has finished for PR 6685 at commit
|
what does this building error mean?
|
Test build #35428 has finished for PR 6685 at commit
|
Test build #35543 has finished for PR 6685 at commit
|
Test build #35546 has finished for PR 6685 at commit
|
hi @andrewor14 , what can i do for this error
|
probably not your fault... retest this please |
Test build #35583 has finished for PR 6685 at commit
|
@ankurdave could you have a look? |
Can one of the admins verify this patch? |
|
||
// convert other EdgeRDD to kv pair RDD | ||
val otherPair = other.edges.mapPartitions { | ||
iter => iter.map { edge => (edge.srcId.toString + edge.dstId.toString, edge) } |
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
I believe you should add some delimiter when concatenating. Otherwise two different edges can be glued together (i.e. 1 -> 12 and 11 -> 2).
I think this has gone stale. Could you close this PR? |
The union of two graphs G(VG, EG) and H(VH, EH) is the union of their vertex sets and their edge families. Which means G ∪ H = (VG ∪ VH, EG ∪ EH).
I implement by
fullOuterJoin
the current Graph'sVertexRDD
with the other Graph'sVertexRDD
merging the same Attribute. Then convert the two Graph EdgeRDD to key value pair likesrcId+DstId -> Edge
,fullOuterJoin
the two and merge the sameEdge
attribute with the parameter functionmergeSameEdgeAttr
.