Directed Graph cluster coefficient provides incorrect values in certain situations #517

merged 1 commit into from Feb 25, 2012

2 participants


was Bug #768938 in launchpad

It is a workaround.

Gephi was relying on triangle counting for directed graph clustering computation. The definition of clustering for directed graph does not directly use triangles and thus computed values was wrong.

The algorithm used to count triangles was also not designed for directed graph.

The workaround is to use a brute force algorithm for directed graph and the faster one for non directed graph.

A nicer solution would be to find a good algorithm for directed graph, but I do not know one.

@taynaud taynaud Fix issue 58
was Bug #768938 in launchpad
@eduramiba eduramiba was assigned Feb 25, 2012
@eduramiba eduramiba merged commit 9f7b789 into gephi:master Feb 25, 2012
Gephi member

Thanks for the fix Thomas, it is merged now.


@eduramiba eduramiba was unassigned by mbastian Feb 4, 2016
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment