[
https://issues.apache.org/jira/browse/FLINK-2905?page=com.atlassian.jira.plugin.system.issuetabpanels:comment-tabpanel&focusedCommentId=14991633#comment-14991633
]
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_r44008216
--- Diff:
flink-libraries/flink-gelly-scala/src/main/scala/org/apache/flink/graph/scala/Graph.scala
---
@@ -968,6 +968,46 @@ TypeInformation : ClassTag](jgraph: jg.Graph[K, VV,
EV]) {
}
/**
+ * Performs intersect on the edge sets of the input graphs. Edges are
considered equal, if they
+ * have the same source identifier, target identifier and edge value.
+ * <p>
+ * The algorithm computes pairs of matching edges from the input graphs.
If the same edge occurs
+ * multiple times in the input graphs, there will be multiple edge pairs
to be considered. The
+ * output graph will contain exactly one edge representing all matching
pairs.
+ * <p>
+ * Vertices in the output graph will have no vertex values.
+ *
+ * @param graph the graph to perform intersect with
+ * @return a new graph which contains common vertices and edges from the
input graphs
--- End diff --
We have "equal", "matching" and "common" to describe the edges of the
result. I would stick to one of those to avoid confusion.
> 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)
