|  1 |    initial version    |  
A valid construction is tp merge the vertices of $A$ to a single vertex $a$ and the vertices of $B$ to a single vertex $b$. Then it remains to fin a minimum cut between $a$ and $b$. You can use method G.merge_vertices(A) which will merge all the vertices in $A$ to the first vertex of the list $A$.
    |  2 |    No.2 Revision    |  
A valid construction is tp to merge the vertices of $A$ to a single vertex $a$ and the vertices of $B$ to a single vertex $b$. Then it remains to fin a minimum cut between $a$ and $b$. You can use method G.merge_vertices(A) which will merge all the vertices in $A$ to the first vertex of the list $A$.
    |  3 |    No.3 Revision    |  
A valid construction is to merge the vertices of $A$ to a single vertex $a$ and the vertices of $B$ to a single vertex $b$. Then it remains to fin find a minimum cut between $a$ and $b$. You can use method G.merge_vertices(A) which will merge all the vertices in $A$ to the first vertex of the list $A$.
 
                
                Copyright Sage, 2010. Some rights reserved under creative commons license. Content on this site is licensed under a Creative Commons Attribution Share Alike 3.0 license.