triadic_census(G, nodelist=None)
The triadic census is a count of how many of the 16 possible types of triads are present in a directed graph. If a list of nodes is passed, then only those triads are taken into account which have elements of nodelist in them.
This algorithm has complexity $O(m)$ where $m$ is the number of edges in the graph.
A NetworkX DiGraph
List of nodes for which you want to calculate triadic census
If :None:None:`nodelist` contains duplicate nodes or nodes not in G. If you want to ignore this you can preprocess with :None:None:`set(nodelist) & G.nodes`
Dictionary with triad type as keys and number of occurrences as values.
Determines the triadic census of a directed graph.
The following pages refer to to this document either explicitly or contain code examples using this.
networkx.generators.triads.triad_graph
Hover to see nodes names; edges to Self not shown, Caped at 50 nodes.
Using a canvas is more power efficient and can get hundred of nodes ; but does not allow hyperlinks; , arrows or text (beyond on hover)
SVG is more flexible but power hungry; and does not scale well to 50 + nodes.
All aboves nodes referred to, (or are referred from) current nodes; Edges from Self to other have been omitted (or all nodes would be connected to the central node "self" which is not useful). Nodes are colored by the library they belong to, and scaled with the number of references pointing them