[
https://issues.apache.org/jira/browse/FLINK-2905?page=com.atlassian.jira.plugin.system.issuetabpanels:comment-tabpanel&focusedCommentId=14976558#comment-14976558
]
Vasia Kalavri commented on FLINK-2905:
--------------------------------------
This is still not clear to me.
Correct me if I'm wrong, but the intersection of 2 graphs is a new graph, which
maintains one edge for each edge that is common in the 2 input graphs, i.e.
intersection should not have duplicate edges. The example with the
transportation networks should work with either a union + aggregation or a join
the edge sets on <src, trg>. A solution would be to have the {{intersect}}
method look at the IDs only and receive a UDF which can be applied on the
common edge values. This way, the output graph won't have any duplicates and
you can do whatever you want with the common edges values. Does this make sense?
> Add intersect method to Graph class
> -----------------------------------
>
> Key: FLINK-2905
> URL: https://issues.apache.org/jira/browse/FLINK-2905
> Project: Flink
> Issue Type: New Feature
> Components: Gelly
> Affects Versions: 0.10
> Reporter: Martin Junghanns
> Assignee: Martin Junghanns
> Priority: Minor
>
> Currently, the Gelly Graph supports the set operations
> {{Graph.union(otherGraph)}} and {{Graph.difference(otherGraph)}}. It would be
> nice to have a {{Graph.intersect(otherGraph)}} method, where the resulting
> graph contains all vertices and edges contained in both input graphs.
--
This message was sent by Atlassian JIRA
(v6.3.4#6332)
