View source: R/network-summary.R
| network_girth | R Documentation |
Computes the girth of a network, the length of its shortest cycle. Edge direction, self-loops and repeated undirected edges are ignored. A pair of reciprocal directed edges counts as a cycle of length 2, so a directed network with any mutual tie has girth 2. An undirected forest has girth Inf.
network_girth(x, ...)
x |
Network input: matrix, igraph, network, cograph_network, or tna object |
... |
Passed to |
Numeric scalar: the length of the shortest cycle, or Inf if the graph has no cycle.
network_girth(regulation_net)
Add the following code to your website.
For more information on customizing the embed code, read Embedding Snippets.