Graph Density

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

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.