The density of a graph is the ratio of the number of edges and the number of possible edges.
The input graph.
Logical constant, whether to allow loop edges in the graph. If this is TRUE then self loops are considered to be possible. If this is FALSE then we assume that the graph does not contain any loop edges and that loop edges are not meaningful.
Note that this function may return strange results for graph with multiple edges, density is ill-defined for graphs with multiple edges.
A real constant. This function returns
NaN (=0.0/0.0) for an
empty graph with zero vertices.
Gabor Csardi firstname.lastname@example.org
Wasserman, S., and Faust, K. (1994). Social Network Analysis: Methods and Applications. Cambridge: Cambridge University Press.
1 2 3 4 5 6 7 8 9
Add the following code to your website.
For more information on customizing the embed code, read Embedding Snippets.