Description Usage Arguments Details Value Author(s) References See Also Examples

View source: R/structural.properties.R

The density of a graph is the ratio of the number of edges and the number of possible edges.

1 | ```
edge_density(graph, loops = FALSE)
``` |

`graph` |
The input graph. |

`loops` |
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 csardi.gabor@gmail.com

Wasserman, S., and Faust, K. (1994). Social Network Analysis: Methods and Applications. Cambridge: Cambridge University Press.

`vcount`

, `ecount`

, `simplify`

to get rid of the multiple and/or loop edges.

1 2 3 4 5 6 7 8 9 | ```
g1 <- make_empty_graph(n=10)
g2 <- make_full_graph(n=10)
g3 <- sample_gnp(n=10, 0.4)
# loop edges
g <- graph( c(1,2, 2,2, 2,3) )
edge_density(g, loops=FALSE) # this is wrong!!!
edge_density(g, loops=TRUE) # this is right!!!
edge_density(simplify(g), loops=FALSE) # this is also right, but different
``` |

Embedding an R snippet on your website

Add the following code to your website.

For more information on customizing the embed code, read Embedding Snippets.