[
https://issues.apache.org/jira/browse/FLINK-2254?page=com.atlassian.jira.plugin.system.issuetabpanels:comment-tabpanel&focusedCommentId=15535322#comment-15535322
]
ASF GitHub Bot commented on FLINK-2254:
---------------------------------------
Github user vasia commented on the issue:
https://github.com/apache/flink/pull/2564
Providing a flattened tuple is certainly better than having the user
implement the reduce, but I think we should provide separate methods for the
default and custom operations. A projection is a very well-defined operation:
create a graph where there is an edge between any pair of vertices with a
common neighbor in the bipartite graph. If the user wants to apply mappers or
other transformations on the vertices and edges, they can do so afterwards,
using the graph methods. The problem is that with a projections, some
information is lost, e.g. the edge values. For these cases, we can provide a
custom projection method where we give the labels in a flattened tuple as
@greghogan suggested, but I'm afraid the API will look ugly with a Tuple8
there. Another, maybe more friendly solution, would be attaching the labels on
the projection graph edges. What do you think?
> 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.0
> Reporter: Andra Lungu
> Assignee: Ivan Mushketyk
> 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)
