Returns True if nodes and G/nodes are a bipartition of G.
Parameters : | G : NetworkX graph nodes: list or container :
|
---|
Notes
For connected graphs the bipartite sets are unique. This function handles disconnected graphs.
Examples
>>> from networkx.algorithms import bipartite
>>> G = nx.path_graph(4)
>>> X = set([1,3])
>>> bipartite.is_bipartite_node_set(G,X)
True