[
https://issues.apache.org/jira/browse/SPARK-7894?page=com.atlassian.jira.plugin.system.issuetabpanels:comment-tabpanel&focusedCommentId=14579283#comment-14579283
]
Ilya Ganelin edited comment on SPARK-7894 at 6/9/15 5:38 PM:
-------------------------------------------------------------
How is this functionality different from the existing {{union}} functions
within {{VertexRDD}} and {{EdgeRDD}} ?
was (Author: ilganeli):
How is this functionality different from the existing `union` functions within
`VertexRDD` and `EdgeRDD` ?
> Graph Union Operator
> --------------------
>
> Key: SPARK-7894
> URL: https://issues.apache.org/jira/browse/SPARK-7894
> Project: Spark
> Issue Type: Sub-task
> Components: GraphX
> Reporter: Andy Huang
> Labels: graph, union
> Attachments: union_operator.png
>
>
> This operator aims to union two graphs and generate a new graph directly. The
> union of two graphs is the union of their vertex sets and their edge
> families.Vertexes and edges which are included in either graph will be part
> of the new graph.
> bq. G ∪ H = (VG ∪ VH, EG ∪ EH).
> The below image shows a union of graph G and graph H
> !union_operator.png|width=600px,align=center!
> A Simple interface would be：
> bq. def union[VD: ClassTag, ED: ClassTag](other: Graph[VD, ED]): Graph[VD, ED]
> However, inevitably vertexes and edges overlapping will happen between
> borders of graphs. For vertex, it's quite nature to just make a union and
> remove those duplicate ones. But for edges, a mergeEdges function seems to be
> more reasonable.
> bq. def union[VD: ClassTag, ED: ClassTag](other: Graph[VD, ED], mergeEdges:
> (ED, ED) => ED): Graph[VD, ED]
--
This message was sent by Atlassian JIRA
(v6.3.4#6332)
---------------------------------------------------------------------
To unsubscribe, e-mail: issues-unsubscr...@spark.apache.org
For additional commands, e-mail: issues-h...@spark.apache.org
