triadic_census(G)[source]

Determines the triadic census of a directed graph.

The triadic census is a count of how many of the 16 possible types of triads are present in a directed graph.

Parameters: G (digraph) – A NetworkX DiGraph census – Dictionary with triad names as keys and number of occurrences as values. dict

Notes

This algorithm has complexity $$O(m)$$ where $$m$$ is the number of edges in the graph.

triad_graph()