clusteringCoefficient-methods: Clustering coefficient of a graph
Description
This generic function takes an object that inherits from the graph
class. The graph needs to have edgemode=="undirected". If it has
edgemode=="directed", the function will return NULL.
Usage
"clusteringCoefficient"(object, selfLoops=FALSE)
Arguments
object
An instance of the appropriate graph class.
selfLoops
Logical. If true, the calculation
takes self loops into account.
Value
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.
Details
For a node with n adjacent nodes, if selfLoops is
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.
If selfLoops is TRUE, the clustering coefficent is
N/(n*n), where N is the number of edges between these nodes,
including self loops.