fidZddlZddgZejddZejdd dZdS) zUnary operations on graphsN complementreverseT) returns_graphc}||fdD|S)arReturns the graph complement of G. Parameters ---------- G : graph A NetworkX 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. Examples -------- >>> G = nx.Graph([(1, 2), (1, 3), (2, 3), (3, 4), (3, 5)]) >>> G_complement = nx.complement(G) >>> G_complement.edges() # This shows the edges of the complemented graph EdgeView([(1, 4), (1, 5), (2, 4), (2, 5), (4, 5)]) c3DK|]\}}D]}||v||k ||fVdS)N).0nnbrsn2Gs {/var/www/development/aibuddy-work/election-extract/venv/lib/python3.11/site-packages/networkx/algorithms/operators/unary.py zcomplement..'sDWWWQWW"Rt^^qTVww!RwwwwwWW) __class__add_nodes_fromadd_edges_from adjacency)r Rs` rrrsd8 AQWWWW WWW Hrc~|stjd||S)aaReturns the reverse directed graph of G. Parameters ---------- G : directed graph A NetworkX directed graph copy : bool If True, then a new graph is returned. If False, then the graph is reversed in place. Returns ------- H : directed graph The reversed G. Raises ------ NetworkXError If graph is undirected. Examples -------- >>> G = nx.DiGraph([(1, 2), (1, 3), (2, 3), (3, 4), (3, 5)]) >>> G_reversed = nx.reverse(G) >>> G_reversed.edges() OutEdgeView([(2, 1), (3, 1), (3, 2), (4, 3), (5, 3)]) z#Cannot reverse an undirected graph.)copy) is_directednx NetworkXErrorr)r rs rrr,s:< ==??$DEEEyydy###r)T)__doc__networkxr__all__ _dispatchablerrrrrrs   #%%%   &%  F%%% $ $ $&% $ $ $r