[
https://issues.apache.org/jira/browse/FLINK-2254?page=com.atlassian.jira.plugin.system.issuetabpanels:comment-tabpanel&focusedCommentId=14966699#comment-14966699
]
Vasia Kalavri commented on FLINK-2254:
--------------------------------------
Hi [~ssaumitra],
you are right. Specialized algorithms for bipartite graphs can be added later.
For this issue, it would suffice to provide (a) a bipartite graph
representation and (b) utility and basic transformation methods for bipartite
graphs, i.e. retrieving the two modes, degrees, map/filter/join etc.
> Add Bipartite Graph Support for Gelly
> -------------------------------------
>
> Key: FLINK-2254
> URL: https://issues.apache.org/jira/browse/FLINK-2254
> Project: Flink
> Issue Type: New Feature
> Components: Gelly
> Affects Versions: 0.10
> Reporter: Andra Lungu
> Labels: requires-design-doc
>
> A bipartite graph is a graph for which the set of vertices can be divided
> into two disjoint sets such that each edge having a source vertex in the
> first set, will have a target vertex in the second set. We would like to
> support efficient operations for this type of graphs along with a set of
> metrics(http://jponnela.com/web_documents/twomode.pdf).
--
This message was sent by Atlassian JIRA
(v6.3.4#6332)
