Graph Density

Sébastien Heymann edited this page Mar 1, 2015 · 1 revision

Measures how close the network is to complete. A complete graph has all possible edges and density equal to 1.

Source code

See org.gephi.statistics.plugin.GraphDensity.java.

Acknowledgements

This code was implemented by Mathieu Bastian.

Clone this wiki locally
You can’t perform that action at this time.
You signed in with another tab or window. Reload to refresh your session. You signed out in another tab or window. Reload to refresh your session.
Press h to open a hovercard with more details.