diff options
| author | Alan Mishchenko <alanmi@berkeley.edu> | 2005-08-29 08:01:00 -0700 |
|---|---|---|
| committer | Alan Mishchenko <alanmi@berkeley.edu> | 2005-08-29 08:01:00 -0700 |
| commit | 2b85f5ba649bcc81873697718fe8a9085d09c31d (patch) | |
| tree | 66acda3d3e1bdfb224588ffe4b3ebf2737649101 /src/sop/ft | |
| parent | 3c25decf65704916943b0569e6d0608072550a89 (diff) | |
| download | abc-2b85f5ba649bcc81873697718fe8a9085d09c31d.tar.gz abc-2b85f5ba649bcc81873697718fe8a9085d09c31d.tar.bz2 abc-2b85f5ba649bcc81873697718fe8a9085d09c31d.zip | |
Version abc50829
Diffstat (limited to 'src/sop/ft')
| -rw-r--r-- | src/sop/ft/ftFactor.c | 8 |
1 files changed, 4 insertions, 4 deletions
diff --git a/src/sop/ft/ftFactor.c b/src/sop/ft/ftFactor.c index d25d0653..19f70e36 100644 --- a/src/sop/ft/ftFactor.c +++ b/src/sop/ft/ftFactor.c @@ -319,10 +319,10 @@ Ft_Node_t * Ft_FactorTrivialTree_rec( Vec_Int_t * vForm, Ft_Node_t ** ppNodes, i return ppNodes[0]; // split the nodes into two parts -// nNodes1 = nNodes/2; -// nNodes2 = nNodes - nNodes1; - nNodes2 = nNodes/2; - nNodes1 = nNodes - nNodes2; + nNodes1 = nNodes/2; + nNodes2 = nNodes - nNodes1; +// nNodes2 = nNodes/2; +// nNodes1 = nNodes - nNodes2; // recursively construct the tree for the parts pNode1 = Ft_FactorTrivialTree_rec( vForm, ppNodes, nNodes1, fAnd ); |