o &?e@sdZddlZddlmZdgZidgddgddd gd d d gd dd gddd gdgddgddgddgddgddgddgddgddgd d!gd"Zejdd#d$dZdS)%zZFunctions that generate the triad graphs, that is, the possible digraphs on three nodes. N)DiGraph triad_graphZ003Z012abZ102baZ021DbcZ021UcbZ021CZ111D)accarZ111U)rr rZ030T)rrrZ030C)rrrZ201)rrrr Z120D)rrrr Z120U)rrrr Z120C)rrrr Z210)rrrrr Z300)rrrrrr )ZgraphscCs:|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 ValueErrorrZadd_nodes_fromZadd_edges_from)Z triad_nameGr[/home/www/facesmatcher.com/pyenv/lib/python3.10/site-packages/networkx/generators/triads.pyr$s!  ) __doc__ZnetworkxnxZnetworkx.classesr__all__r _dispatchrrrrrsN