Hi Fabian,
It should be trivial to implement inDegrees and outDegrees using the new
algorithms. We are now doing this for the translate methods in FLINK-3771.
The algorithms implement additional customization but the Graph methods are
kept simple. ScatterGatherIteration could be simplified as well
Hey Greg,
when we made the initial design for Gelly, we discussed having separate
directed and undirected graph types.
We decided to represent undirected graphs by simply adding the
opposite-direction edges, like Apache Giraph does. I'm not sure whether
that was a good idea, but, back then, it see
Hi Fabian,
I don't know if this has been looked at. There is discussion of
BipartiteGraph in FLINK-2254. If Gelly had DirectedGraph and
UndirectedGraph then the API could stay lean while methods could be tuned
for the specific graph type. I do like having simple APIs such as DataSet
and Graph for
Hi Greg and Vasia,
thanks for starting this discussion.
I think it is a good idea to update the Gelly roadmap. As Vasia said, many
items on the list have been implemented and other have been more or less
dropped.
Also new persons who want to improve Gelly have joint the community while
others have
Hi all,
I asked Greg to start a discussion here about FLINK-3771 and FLINK-3772, to
make sure we're all on the same page about future Gelly development.
About a year ago we created the Gelly roadmap [1]. Many of these items have
been implemented and others were researched and either developed ext
Vasia and I are looking for additional feedback on FLINK-3772. This ticket
[0] and PR [1] provides a set of graph algorithms which compute and store
the degree for vertices and edges.
Degree annotation is a basic component of many algorithms. For example,
PageRank requires the vertex out-degree to
