Join GitHub today
GitHub is home to over 28 million developers working together to host and review code, manage projects, and build software together.Sign up
Directed Graph cluster coefficient provides incorrect values in certain situations #517
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.