ó |£*^c@s|dZddlZdjddgƒZdddd d d gZd „Zd „Zd„Zd„Z d„Z dd„Z dS(sR ========================== Bipartite Graph Algorithms ========================== iÿÿÿÿNs s%Jordi Torrents s%Aric Hagberg t is_bipartitetis_bipartite_node_settcolortsetstdensitytdegreescs8ˆjƒr-ddl‰‡‡fd†}n ˆj}i}xÓˆD]Ë}||ksCtˆ|ƒdkrqqCn|g}d||>> from networkx.algorithms import bipartite >>> G = nx.path_graph(4) >>> c = bipartite.color(G) >>> print(c) {0: 1, 1: 0, 2: 1, 3: 0} You can use this to set a node attribute indicating the biparite set: >>> nx.set_node_attributes(G, 'bipartite', c) >>> print(G.node[0]['bipartite']) 1 >>> print(G.node[1]['bipartite']) 0 iÿÿÿÿNcs(ˆjjˆj|ƒˆj|ƒgƒS(N(tchaint from_iterabletpredecessors_itertsuccessors_iter(tv(tGt itertools(sw/home/gitlab-runner/builds/8480fa44/0/bergerc/fluidmanager-web/art-framework/bin/networkx/algorithms/bipartite/basic.pyt neighbors<siisGraph is not bipartite.( t is_directedR tneighbors_itertlentpoptnxt NetworkXErrortappendtupdatetdicttfromkeystisolates(R R RtntqueueR tctw((R R sw/home/gitlab-runner/builds/8480fa44/0/bergerc/fluidmanager-web/art-framework/bin/networkx/algorithms/bipartite/basic.pyRs*"    "      "cCs.yt|ƒtSWntjk r)tSXdS(sG Returns True if graph G is bipartite, False if not. Parameters ---------- G : NetworkX graph Examples -------- >>> from networkx.algorithms import bipartite >>> G = nx.path_graph(4) >>> print(bipartite.is_bipartite(G)) True See Also -------- color, is_bipartite_node_set N(RtTrueRRtFalse(R ((sw/home/gitlab-runner/builds/8480fa44/0/bergerc/fluidmanager-web/art-framework/bin/networkx/algorithms/bipartite/basic.pyRVs  cCs|t|ƒ}xitj|ƒD]X}t|ƒ\}}|j|ƒrR|j|ƒpm|j|ƒom|j|ƒstSqWtS(sùReturns True if nodes and G/nodes are a bipartition of G. Parameters ---------- G : NetworkX graph nodes: list or container Check if nodes are a one of a bipartite set. Examples -------- >>> from networkx.algorithms import bipartite >>> G = nx.path_graph(4) >>> X = set([1,3]) >>> bipartite.is_bipartite_node_set(G,X) True Notes ----- For connected graphs the bipartite sets are unique. This function handles disconnected graphs. (tsetRtconnected_component_subgraphsRtissubsett isdisjointRR(R tnodestStCCtXtY((sw/home/gitlab-runner/builds/8480fa44/0/bergerc/fluidmanager-web/art-framework/bin/networkx/algorithms/bipartite/basic.pyRns csNt|ƒ‰t‡fd†ˆDƒƒ}t‡fd†ˆDƒƒ}||fS(sõReturns bipartite node sets of graph G. Raises an exception if the graph is not bipartite. Parameters ---------- G : NetworkX graph Returns ------- (X,Y) : two-tuple of sets One set of nodes for each part of the bipartite graph. Examples -------- >>> from networkx.algorithms import bipartite >>> G = nx.path_graph(4) >>> X, Y = bipartite.sets(G) >>> list(X) [0, 2] >>> list(Y) [1, 3] See Also -------- color c3s|]}ˆ|r|VqdS(N((t.0R(R(sw/home/gitlab-runner/builds/8480fa44/0/bergerc/fluidmanager-web/art-framework/bin/networkx/algorithms/bipartite/basic.pys «sc3s|]}ˆ|s|VqdS(N((R(R(R(sw/home/gitlab-runner/builds/8480fa44/0/bergerc/fluidmanager-web/art-framework/bin/networkx/algorithms/bipartite/basic.pys ¬s(RR(R R&R'((Rsw/home/gitlab-runner/builds/8480fa44/0/bergerc/fluidmanager-web/art-framework/bin/networkx/algorithms/bipartite/basic.pyRŽs cCs…t|ƒ}tj|ƒ}t|ƒ}||}|dkrFd}n;|jƒrm|dt||ƒ}n|t||ƒ}|S(s Return density of bipartite graph B. Parameters ---------- G : NetworkX graph nodes: list or container Nodes in one set of the bipartite graph. Returns ------- d : float The bipartite density Examples -------- >>> from networkx.algorithms import bipartite >>> G = nx.complete_bipartite_graph(3,2) >>> X=set([0,1,2]) >>> bipartite.density(G,X) 1.0 >>> Y=set([3,4]) >>> bipartite.density(G,Y) 1.0 See Also -------- color igg@(RRtnumber_of_edgesRtfloat(tBR#Rtmtnbtnttd((sw/home/gitlab-runner/builds/8480fa44/0/bergerc/fluidmanager-web/art-framework/bin/networkx/algorithms/bipartite/basic.pyR¯s      cCs>t|ƒ}t|ƒ|}|j||ƒ|j||ƒfS(sUReturn the degrees of the two node sets in the bipartite graph B. Parameters ---------- G : NetworkX graph nodes: list or container Nodes in one set of the bipartite graph. weight : string or None, optional (default=None) The edge attribute that holds the numerical value used as a weight. If None, then each edge has weight 1. The degree is the sum of the edge weights adjacent to the node. Returns ------- (degX,degY) : tuple of dictionaries The degrees of the two bipartite sets as dictionaries keyed by node. Examples -------- >>> from networkx.algorithms import bipartite >>> G = nx.complete_bipartite_graph(3,2) >>> Y=set([3,4]) >>> degX,degY=bipartite.degrees(G,Y) >>> degX {0: 2, 1: 2, 2: 2} See Also -------- color, density (Rtdegree(R+R#tweighttbottomttop((sw/home/gitlab-runner/builds/8480fa44/0/bergerc/fluidmanager-web/art-framework/bin/networkx/algorithms/bipartite/basic.pyRÚs! ( t__doc__tnetworkxRtjoint __author__t__all__RRRRRtNoneR(((sw/home/gitlab-runner/builds/8480fa44/0/bergerc/fluidmanager-web/art-framework/bin/networkx/algorithms/bipartite/basic.pyts     >  ! +