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
Returns:census – Dictionary with triad names as keys and number of occurrences as values.
Return type:dict


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


[1]Vladimir Batagelj and Andrej Mrvar, A subquadratic triad census algorithm for large sparse networks with small maximum degree, University of Ljubljana,