rustworkx.digraph_transitivity

digraph_transitivity(graph, /)

Compute the transitivity of a directed graph.

The transitivity of a directed graph is defined in [Fag], Eq.8:

\[`c=3 \times \frac{\text{number of triangles}}{\text{number of all possible triangles}}`\]

A triangle is a connected triple of nodes. Different edge orientations counts as different triangles.

This function is multithreaded and will run launch a thread pool with threads equal to the number of CPUs by default. You can tune the number of threads with the RAYON_NUM_THREADS environment variable. For example, setting RAYON_NUM_THREADS=4 would limit the thread pool to 4 threads.

Note

The function implicitly assumes that there are no parallel edges or self loops. It may produce incorrect/unexpected results if the input graph has self loops or parallel edges.

Parameters:

graph (PyDiGraph) – Directed graph to be used.

Returns:

Transitivity.

Return type:

float

[Fag]

Clustering in complex directed networks by G. Fagiolo, Physical Review E, 76(2), 026107 (2007)