You are viewing a plain text version of this content. The canonical link for it is here.
Posted to issues@flink.apache.org by "Andra Lungu (JIRA)" <ji...@apache.org> on 2015/08/23 10:08:45 UTC
[jira] [Created] (FLINK-2563) Gelly's Graph Algorithm Interface is
limites
Andra Lungu created FLINK-2563:
----------------------------------
Summary: Gelly's Graph Algorithm Interface is limites
Key: FLINK-2563
URL: https://issues.apache.org/jira/browse/FLINK-2563
Project: Flink
Issue Type: Improvement
Components: Gelly
Affects Versions: 0.9, 0.10
Reporter: Andra Lungu
Right now, Gelly's `GraphAlgorithm` interface only allows users/devs to return the same type of Graph.
public Graph<K, VV, EV> run(Graph<K, VV, EV> input) throws Exception;
In numerous cases, one needs to return a single value, or a modified graph.
Off the top of my head, say one would like to implement a Triangle Count library method. That takes as input a Graph and returns the total number of triangles.
https://github.com/andralungu/gelly-partitioning/blob/master/src/main/java/example/GSATriangleCount.java
With the current Gelly abstractions, something like this cannot be supported. Also if I initially had a Graph of Long, Long, NullValue and my algorithm changed the edge values to type Double, for instance, I would again have created an implementation which is not supported.
--
This message was sent by Atlassian JIRA
(v6.3.4#6332)