#

Note

This documents the development version of NetworkX. Documentation for the current release can be found here.

#

networkx.generators.triads.triad_graph¶

triad_graph(triad_name)[source]¶

Returns the triad graph with the given 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.

Parameters: triad_name (string) – The name of a triad, as described above.
Returns: The digraph on three nodes with the given name. The nodes of the graph are the single-character strings ‘a’, ‘b’, and ‘c’.
Return type: DiGraph
Raises: ValueError – If triad_name is not the name of a triad.