U 9v fˆã@s¨dZddlmZdgZgdgddgddgddgddgdd dgdd dgdddgdddgdddd gdddd gdddd gdddd gddddd gdddddd gd œZd d„Zd S) zZFunctions that generate the triad graphs, that is, the possible digraphs on three nodes. é)ÚDiGraphÚ triad_graphÚabÚbaZbcÚcbÚacÚca)Z003Z012Z102Z021DZ021UZ021CZ111DZ111UZ030TZ030CZ201Z120DZ120UZ120CZ210Z300cCs:|tkrtd|›dƒ‚tƒ}| 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 constantÚabc)Ú TRIAD_EDGESÚ ValueErrorrZadd_nodes_fromZadd_edges_from)Z triad_nameÚG©r ú>/tmp/pip-unpacked-wheel-_lngutwb/networkx/generators/triads.pyr#s  ÿ N)Ú__doc__Znetworkx.classesrÚ__all__r rr r r rÚs(      ð