This generic function takes an object that inherits from the
class. The graph needs to have
edgemode=="undirected". If it has
edgemode=="directed", the function will return NULL.
An instance of the appropriate graph class.
Logical. If true, the calculation takes self loops into account.
For a node with n adjacent nodes, if
FALSE, the clustering coefficent is
N/(n*(n-1)), where N is the number of edges between these nodes.
The graph may not have self loops.
TRUE, the clustering coefficent is
N/(n*n), where N is the number of edges between these nodes,
including self loops.
A named numeric vector with the clustering coefficients for each node. For nodes with 2 or more edges, the values are between 0 and 1. For nodes that have no edges, the function returns the value NA. For nodes that have exactly one edge, the function returns NaN.
Wolfgang Huber http://www.dkfz.de/mga/whuber
1 2 3 4
Add the following code to your website.
For more information on customizing the embed code, read Embedding Snippets.