A problem of even partition is a interesting problem. Since we almost can not imaginate its structure when the dimension of a hypercube is over 6. We have to develop some simple tool for more understanding it. The following is a flowchart of our simple tool.
It contains three major functions: (1)Generate a set of cut nodes for partition, (2)Determine all aggregates after partitioned, and (3)Analyze the result.
But there are still some problem here. As we known number of nodes in hypercube grows exponentially. It will run out of meomory when the dimension get larger and larger.