diff options
| author | Alan Mishchenko <alanmi@berkeley.edu> | 2005-08-24 08:01:00 -0700 |
|---|---|---|
| committer | Alan Mishchenko <alanmi@berkeley.edu> | 2005-08-24 08:01:00 -0700 |
| commit | 9093ca53201519ef03dedb7044345fc716cc0643 (patch) | |
| tree | 8f1ccb4fe6c193b64e1687e003946f294f97c428 /src/sop/ft | |
| parent | d01b1a0eee0ff49d18d8235f533fbb214c61d28a (diff) | |
| download | abc-9093ca53201519ef03dedb7044345fc716cc0643.tar.gz abc-9093ca53201519ef03dedb7044345fc716cc0643.tar.bz2 abc-9093ca53201519ef03dedb7044345fc716cc0643.zip | |
Version abc50824
Diffstat (limited to 'src/sop/ft')
| -rw-r--r-- | src/sop/ft/ftFactor.c | 4 |
1 files changed, 2 insertions, 2 deletions
diff --git a/src/sop/ft/ftFactor.c b/src/sop/ft/ftFactor.c index 43f9e3ce..1654973f 100644 --- a/src/sop/ft/ftFactor.c +++ b/src/sop/ft/ftFactor.c @@ -320,8 +320,8 @@ 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; // recursively construct the tree for the parts pNode1 = Ft_FactorTrivialTree_rec( vForm, ppNodes, nNodes1, fAnd ); |