[
https://issues.apache.org/jira/browse/FLINK-2905?page=com.atlassian.jira.plugin.system.issuetabpanels:comment-tabpanel&focusedCommentId=14991628#comment-14991628
]
ASF GitHub Bot commented on FLINK-2905:
---------------------------------------
Github user vasia commented on a diff in the pull request:
https://github.com/apache/flink/pull/1329#discussion_r44008073
--- Diff: docs/libs/gelly_guide.md ---
@@ -485,13 +485,15 @@ val networkWithWeights =
network.joinWithEdgesOnSource(vertexOutDegrees, (v1: Do
* <strong>Undirected</strong>: In Gelly, a `Graph` is always directed.
Undirected graphs can be represented by adding all opposite-direction edges to
a graph. For this purpose, Gelly provides the `getUndirected()` method.
-* <strong>Union</strong>: Gelly's `union()` method performs a union
operation on the vertex and edge sets of the specified graph and current graph.
Duplicate vertices are removed from the resulting `Graph`, while if duplicate
edges exists, these will be maintained.
+* <strong>Union</strong>: Gelly's `union()` method performs an union
operation on the vertex and edge sets of the specified graph and the current
graph. Duplicate vertices are removed from the resulting `Graph`, while if
duplicate edges exists, these will be maintained.
--- End diff --
I believe "a union" is the correct way ;)
> 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)
