abc/src/bdd/cudd/cuddClip.c
/**Function********************************************************************

  Synopsis    [Approximates the conjunction of two BDDs f and g.]

  Description [Approximates the conjunction of two BDDs f and g. Returns a
  pointer to the resulting BDD if successful; NULL if the intermediate
  result blows up.]

  SideEffects [None]

  SeeAlso     [Cudd_bddClippingAnd]

******************************************************************************/
Function
Synopsis    [Approximates the conjunction of two BDDs f and g.]

Description [Approximates the conjunction of two BDDs f and g. Returns a
pointer to the resulting BDD if successful; NULL if the intermediate
result blows up.]




Function Synopsis [ Approximates the conjunction of two BDDs f and g . ] Description [ Approximates the conjunction of two BDDs f and g . Returns a pointer to the resulting BDD if successful ; NULL if the intermediate result blows up . ]
DdNode *
cuddBddClippingAnd(
  DdManager * dd ,
  DdNode * f ,
  DdNode * g ,
  int  maxDepth ,
  int  direction )
{
    DdNode *res;
    res = cuddBddClippingAndRecur(dd,f,g,maxDepth,direction);
    return(res);
}
DdNode * cuddBddClippingAnd ( DdManager * dd , DdNode * f , DdNode * g , int maxDepth , int direction ) { DdNode * res ; res = cuddBddClippingAndRecur ( dd , f , g , maxDepth , direction ) ; return ( res ) ; }
Function
Synopsis    [Approximates the conjunction of two BDDs f and g.]
Function Synopsis [ Approximates the conjunction of two BDDs f and g . ]
/* manager */ /* first conjunct */ /* second conjunct */ /* maximum recursion depth */ /* under (0) or over (1) approximation */