WinstonCampeau

#The following code finds the maximum biclique in bipartite graphs. (Note: Not effecient for large bigraphs, but great for multiple small)

#Generates a dictionary containing the sets of neighbors for each vertex in a bipartition (in this case the right bipartition)

for K in some_list_of_bipartite_graphs_you_generate:

  neighbor_sets={}
  for vertex in K.bipartition()[1]:
      neighbor_sets[vertex]=set(K.neighbors(vertex))