[
https://issues.apache.org/jira/browse/FLINK-2905?page=com.atlassian.jira.plugin.system.issuetabpanels:comment-tabpanel&focusedCommentId=14989228#comment-14989228
]
Vasia Kalavri commented on FLINK-2905:
--------------------------------------
Hey Martin,
the problem with the vertex values is that the graphs we're intersecting might
have a common edge whose endpoints have different vertex values. Choosing the
value of the first (or second) graph might not be the desired behavior. How
about we let {{intersect}} only work on edges and ignore vertex values, i.e.
return a graph with no vertex values as a result. If the user wants to choose
vertex values from one of the 2 graphs, they can easily post-process the result
with a {{joinOnVertices}}. What do you think?
> 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)
