Declaring adjacency list of a graph Here at max , we can encounter all the edges with even weight thus there will be 1 pseudo node for each edge
G = [ [ ] for i in range ( 2 * n ) ] NEW_LINE pseudo , pseudo_count = n + 1 , 0 NEW_LINE for i in range ( 0 , m ) : NEW_LINE