ó úŁŐ\c@sSdZddlZddlmZdjdddgƒZdgZdd „Z dS( sUnary operations on graphsi˙˙˙˙N(tis_string_likes sAric Hagberg (hagberg@lanl.gov)sPieter Swart (swart@lanl.gov)sDan Schult(dschult@colgate.edu)t complementcse|dkrdˆj}nˆjƒ}||_|jˆƒ|j‡fd†ˆjƒDƒƒ|S(sžReturn the graph complement of G. Parameters ---------- G : graph A NetworkX graph name : string Specify name for new graph Returns ------- GC : A new graph. Notes ------ Note that complement() does not create self-loops and also does not produce parallel edges for MultiGraphs. Graph, node, and edge data are not propagated to the new graph. scomplement(%s)c3sF|]<\}}ˆD])}||kr||kr||fVqqdS(N((t.0tntnbrstn2(tG(s[/Users/dxp/prism/prism-games/prism-examples/smgs/car/networkx/algorithms/operators/unary.pys *s N(tNonetnamet __class__tadd_nodes_fromtadd_edges_fromtadjacency_iter(RRtR((Rs[/Users/dxp/prism/prism-games/prism-examples/smgs/car/networkx/algorithms/operators/unary.pyRs    ( t__doc__tnetworkxtnxtnetworkx.utilsRtjoint __author__t__all__RR(((s[/Users/dxp/prism/prism-games/prism-examples/smgs/car/networkx/algorithms/operators/unary.pyts