Compute transitivity.
Finds the fraction of all possible triangles which are in fact triangles. Possible triangles are identified by the number of “triads” (two edges with a shared vertex).
T = 3*triangles/triads
| Parameters: | G : graph
|
|---|---|
| Returns: | out : float
|