[
https://issues.apache.org/jira/browse/FLINK-5245?page=com.atlassian.jira.plugin.system.issuetabpanels:comment-tabpanel&focusedCommentId=15744495#comment-15744495
]
Vasia Kalavri commented on FLINK-5245:
--------------------------------------
My point is not that these features are useless for bipartite graphs, but we
have to think whether re-implementing these features specifically for bipartite
graphs makes sense, e.g. because general graphs do not supported them or
because we can use the knowledge that we have a bipartite graph to make
implementation more efficient. For example, projection is a transformation that
can only be applied on bipartite graphs. But if all you want to do is get the
degrees of your bipartite graph, can you use the available Graph methods? Or
can we provide a better way to get the degrees because we know we have a
bipartite graph? These are the questions we have to ask for each of these
features in the list in my opinion.
> Add support for BipartiteGraph mutations
> ----------------------------------------
>
> Key: FLINK-5245
> URL: https://issues.apache.org/jira/browse/FLINK-5245
> Project: Flink
> Issue Type: Improvement
> Components: Gelly
> Reporter: Ivan Mushketyk
> Assignee: Ivan Mushketyk
>
> Implement methods for adding and removing vertices and edges similarly to
> Graph class.
> Depends on https://issues.apache.org/jira/browse/FLINK-2254
--
This message was sent by Atlassian JIRA
(v6.3.4#6332)
