def get_bipartite_proj(G,proj1_name=None,proj2_name=None):
"""docstring for get_bipartite_proj
Returns the bipartite projection for each set
of nodes in the bipartite graph G
"""
if networkx.is_bipartite(G):
set1,set2=networkx.bipartite_sets(G)
net1=networkx.project(G,set1)
net1.name=proj1_name
net2=networkx.project(G,set2)
net2.name=proj2_name
return net1,net2
else:
raise networkx.NetworkXError("Network is not bipartite")
def test_bipartite_sets(self):
G = networkx.path_graph(4)
X, Y = networkx.bipartite_sets(G)
assert_equal(X, set([0, 2]))
assert_equal(Y, set([1, 3]))
def test_bipartite_density(self):
G = nx.path_graph(5)
X, Y = nx.bipartite_sets(G)
density = float(len(G.edges())) / (len(X) * len(Y))
assert_equal(nx.bipartite_density(G, X), density)
def partition(self):
return nx.bipartite_sets(self.G)
def test_bipartite_sets(self):
G=networkx.path_graph(4)
X,Y=networkx.bipartite_sets(G)
assert_equal(X,set([0,2]))
assert_equal(Y,set([1,3]))
def test_bipartite_density(self):
G=nx.path_graph(5)
X,Y=nx.bipartite_sets(G)
density=float(len(G.edges()))/(len(X)*len(Y))
assert_equal(nx.bipartite_density(G,X),density)
