The network contains an odd cycle, so there is no way to split the nodes into two sides
that keeps every edge crossing between them. Removing the 0 edges shown in
red would make it bipartite. Finding the fewest such edges is an
intractable problem, so this is a good set rather than a smallest one.