networkx.algorithms.cluster.transitivity¶
-
transitivity(G)[source]¶ Compute graph transitivity, the fraction of all possible triangles present in G.
Possible triangles are identified by the number of “triads” (two edges with a shared vertex).
The transitivity is
\[T = 3\frac{\#triangles}{\#triads}.\]Parameters: G (graph) Returns: out – Transitivity Return type: float Examples
>>> G = nx.complete_graph(5) >>> print(nx.transitivity(G)) 1.0