o ˷e@sdZddlmZdgZidgddgdddgd dd gd dd gd dd gdgddgddgddgddgddgddgddgddgdd gd!Zd"dZd#S)$zZFunctions that generate the triad graphs, that is, the possible digraphs on three nodes. )DiGraph triad_graph003012ab102ba021Dbc021Ucb021C111D)accar 111U)rrr 030T)rr r030C)rr r201)rrrr120D)r rrr120U)rr rr120C)rr rr210)rr r rr300)rrr r rrcCs:|tvr td|dt}|d|t||S)a 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 ------- :class:`~networkx.DiGraph` The digraph on three nodes with the given name. The nodes of the graph are the single-character strings 'a', 'b', and 'c'. Raises ------ ValueError If `triad_name` is not the name of a triad. See also -------- triadic_census zunknown triad name "z9"; use one of the triad names in the TRIAD_NAMES constantabc) TRIAD_EDGES ValueErrorradd_nodes_fromadd_edges_from) triad_nameGr!Q/var/www/ideatree/venv/lib/python3.10/site-packages/networkx/generators/triads.pyr#s   N)__doc__networkx.classesr__all__rrr!r!r!r"sJ