[ 
https://issues.apache.org/jira/browse/FLINK-2093?page=com.atlassian.jira.plugin.system.issuetabpanels:comment-tabpanel&focusedCommentId=14577397#comment-14577397
 ] 

ASF GitHub Bot commented on FLINK-2093:
---------------------------------------

Github user andralungu commented on a diff in the pull request:

    https://github.com/apache/flink/pull/807#discussion_r31930244
  
    --- Diff: docs/libs/gelly_guide.md ---
    @@ -236,6 +236,8 @@ Graph<Long, Double, Double> networkWithWeights = 
network.joinWithEdgesOnSource(v
     
     * <strong>Union</strong>: Gelly's `union()` method performs a union on the 
vertex and edges sets of the input graphs. Duplicate vertices are removed from 
the resulting `Graph`, while if duplicate edges exists, these will be 
maintained.
     
    +* <strong>Difference</strong>: Gelly's `difference()` method performs a 
difference on the vertex and edges sets of the input graphs. Common vertices 
are removed from the resulting `Graph`, along with the edges which which have 
these vertices as source/target.
    --- End diff --
    
    you have written which twice, "along with the edges which which" :) 


> 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)

Reply via email to