Directed Graph cluster coefficient provides incorrect values in certain situations #517
Conversation
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
was Bug #768938 in launchpad
ghost
assigned 
|
Thanks for the fix Thomas, it is merged now. Eduardo |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
Add this suggestion to a batch that can be applied as a single commit.
This suggestion is invalid because no changes were made to the code.
Suggestions cannot be applied while the pull request is closed.
Suggestions cannot be applied while viewing a subset of changes.
Only one suggestion per line can be applied in a batch.
Add this suggestion to a batch that can be applied as a single commit.
Applying suggestions on deleted lines is not supported.
You must change the existing code in this line in order to create a valid suggestion.
Outdated suggestions cannot be applied.
This suggestion has been applied or marked resolved.
Suggestions cannot be applied from pending reviews.
Suggestions cannot be applied on multi-line comments.
Suggestions cannot be applied while the pull request is queued to merge.
Suggestion cannot be applied right now. Please check back later.
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.