ó ,µ[c@s2dZddlmZdgZigd6dgd6ddgd6dd gd 6dd gd 6dd gd 6ddd gd6ddd gd6dd dgd6dd dgd6ddddgd6d dddgd6dd ddgd6dd ddgd6dd d ddgd6ddd d ddgd6Zd„ZdS(sZFunctions that generate the triad graphs, that is, the possible digraphs on three nodes. iÿÿÿÿ(tDiGrapht triad_grapht003tabt012tbat102tbct021Dtcbt021Ut021Ctactcat111Dt111Ut030Tt030Ct201t120Dt120Ut120Ct210t300cCsO|tkr$tdj|ƒƒ‚ntƒ}|jdƒ|jt|ƒ|S(sReturns 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 ------ :exc:`ValueError` If `triad_name` is not the name of a triad. See also -------- triadic_census sOunknown triad name "{}"; use one of the triad names in the TRIAD_NAMES constanttabc(t TRIAD_EDGESt ValueErrortformatRtadd_nodes_fromtadd_edges_from(t triad_nametG((s9lib/python2.7/site-packages/networkx/generators/triads.pyR)s    N(t__doc__tnetworkx.classesRt__all__RR(((s9lib/python2.7/site-packages/networkx/generators/triads.pyts&