[
https://issues.apache.org/jira/browse/GIRAPH-878?page=com.atlassian.jira.plugin.system.issuetabpanels:comment-tabpanel&focusedCommentId=13940516#comment-13940516
]
Claudio Martella commented on GIRAPH-878:
-----------------------------------------
the clustering coefficient algorithm can be very expensive due to the size of
the messages floating around. this means that it could be effectively used only
for small graphs. I like the idea of an optimized one. Again, I think these
would fit in Okapi very well.
> write clustering coefficient application on giraph
> --------------------------------------------------
>
> Key: GIRAPH-878
> URL: https://issues.apache.org/jira/browse/GIRAPH-878
> Project: Giraph
> Issue Type: New Feature
> Reporter: Pavan Kumar
> Assignee: Pavan Kumar
> Attachments: clustercoeff.patch
>
>
> implements the algorithm at
> http://en.wikipedia.org/wiki/Clustering_coefficient#Local_clustering_coefficient
--
This message was sent by Atlassian JIRA
(v6.2#6252)
