triad_graph(triad_name)
Each string in the following tuple is a valid triad name:
('003', '012', '102', '021D', '021U', '021C', '111D', '111U',
'030T', '030C', '201', '120D', '120U', '120C', '210', '300')
Each triad name corresponds to one of the possible valid digraph on three nodes.
The name of a triad, as described above.
If :None:None:`triad_name` is not the name of a triad.
The digraph on three nodes with the given name. The nodes of the graph are the single-character strings 'a', 'b', and 'c'.
Returns the triad graph with the given name.
The following pages refer to to this document either explicitly or contain code examples using this.
networkx.algorithms.triads.triadic_census
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