Github user greghogan commented on the pull request:
https://github.com/apache/flink/pull/1956#issuecomment-220143133
@vasia that is a very good idea. I've been doing this for `TriangleListing`
for directed clustering coefficient and it should probably be a separate
`GraphAlgorithm`. There is a bitmask for whether the edge is `u -> v`, `u <-
v`, or `u <-> v`.
---
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 [email protected] or file a JIRA ticket
with INFRA.
---
