Github user greghogan commented on the pull request: https://github.com/apache/flink/pull/1671#issuecomment-215503980 The two implementations have small differences but the algorithm is the same. I'll be removing the two steps which are concerned with degree skew since I had not previously looked at the degree distribution but I haven't found a graph that exhibits degree skew under the algorithm's optimization to generate triplets from the vertex with smallest degree. Would be nice to have a proof, though. I expect most of the performance difference to be in `DegreeCounter` and `TriadBuilder` caching objects but not supporting object reuse. Using immutable boxed primitives has the same effect as disabling object reuse since deserialization must create a fresh object each time.
--- If your project is set up for it, you can reply to this email and have your reply appear on GitHub as well. If your project does not have this feature enabled and wishes so, or if the feature is enabled but not working, please contact infrastructure at infrastruct...@apache.org or file a JIRA ticket with INFRA. ---