[
https://issues.apache.org/jira/browse/FLINK-2093?page=com.atlassian.jira.plugin.system.issuetabpanels:comment-tabpanel&focusedCommentId=14585867#comment-14585867
]
ASF GitHub Bot commented on FLINK-2093:
---------------------------------------
Github user andralungu commented on a diff in the pull request:
https://github.com/apache/flink/pull/818#discussion_r32415140
--- Diff:
flink-staging/flink-gelly/src/main/java/org/apache/flink/graph/Graph.java ---
@@ -1151,6 +1151,23 @@ public void coGroup(Iterable<Vertex<K, VV>> vertex,
Iterable<Vertex<K, VV>> vert
}
}
+
+ public Graph<K, VV, EV> removeVertices(DataSet<Vertex<K, VV>>
verticesToBeRemoved){
--- End diff --
Yes, this is definitely the idea, but right now you are duplicating a lot
of code. Can we find a smarter way (i.e. that requires as little code
duplication as possible) :)?
> Add a difference method to Gelly's Graph class
> ----------------------------------------------
>
> Key: FLINK-2093
> URL: https://issues.apache.org/jira/browse/FLINK-2093
> Project: Flink
> Issue Type: New Feature
> Components: Gelly
> Affects Versions: 0.9
> Reporter: Andra Lungu
> Assignee: Shivani Ghatge
> Priority: Minor
>
> This method will compute the difference between two graphs, returning a new
> graph containing the vertices and edges that the current graph and the input
> graph don't have in common.
--
This message was sent by Atlassian JIRA
(v6.3.4#6332)
