[
https://issues.apache.org/jira/browse/FLINK-2044?page=com.atlassian.jira.plugin.system.issuetabpanels:comment-tabpanel&focusedCommentId=15289736#comment-15289736
]
ASF GitHub Bot commented on FLINK-2044:
---------------------------------------
Github user greghogan commented on the pull request:
https://github.com/apache/flink/pull/1956#issuecomment-220147037
I also like @vasia's idea since we might get to add the analytic
`DyadicCensus` (basically counting how many edges are `u <-> v` and `u -> v`).
The relative performance of this implementation will depend on the ratio of
mutual edges. Are there one or more canonical data sets for running a
comparison? The two extremes are an undirected graph and a graph with no mutual
edges, which could be artificially constructed.
Also, I recommend copying the current code into a new class to test a new
implementation.
> Implementation of Gelly HITS Algorithm
> --------------------------------------
>
> Key: FLINK-2044
> URL: https://issues.apache.org/jira/browse/FLINK-2044
> Project: Flink
> Issue Type: New Feature
> Components: Gelly
> Reporter: Ahamd Javid
> Assignee: GaoLun
> Priority: Minor
>
> Implementation of Hits Algorithm in Gelly API using Java. the feature branch
> can be found here: (https://github.com/JavidMayar/flink/commits/HITS)
--
This message was sent by Atlassian JIRA
(v6.3.4#6332)
