New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

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

merged 1 commit into from Feb 25, 2012


None yet
2 participants
Copy link

taynaud commented Feb 1, 2012

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.

Fix issue 58
was Bug #768938 in launchpad

@ghost ghost assigned eduramiba Feb 25, 2012

eduramiba added a commit that referenced this pull request Feb 25, 2012

@eduramiba eduramiba merged commit 9f7b789 into gephi:master Feb 25, 2012


This comment has been minimized.

Copy link

eduramiba commented Feb 25, 2012

Thanks for the fix Thomas, it is merged now.


Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment