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

  Synopsis    [Find a dense superset of BDD <code>f</code>.]

  Description [Finds a dense superset of BDD <code>f</code>. Density is
  the ratio of number of minterms to number of nodes.  Uses several
  techniques in series. It is more expensive than other supersetting
  procedures, but often produces better results. See
  Cudd_SupersetShortPaths for a description of the threshold and nvars
  parameters.  Returns a pointer to the result if successful; NULL
  otherwise.]

  SideEffects [None]

  SeeAlso     [Cudd_SubsetCompress Cudd_SupersetRemap Cudd_SupersetShortPaths
  Cudd_SupersetHeavyBranch Cudd_bddSqueeze]

******************************************************************************/
Function
Synopsis    [Find a dense superset of BDD f.]

Description [Finds a dense superset of BDD f. Density is
the ratio of number of minterms to number of nodes.  Uses several
techniques in series. It is more expensive than other supersetting
procedures, but often produces better results. See
Cudd_SupersetShortPaths for a description of the threshold and nvars
parameters.  Returns a pointer to the result if successful; NULL
otherwise.]




Function Synopsis [ Find a dense superset of BDD f . ] Description [ Finds a dense superset of BDD f . Density is the ratio of number of minterms to number of nodes . Uses several techniques in series . It is more expensive than other supersetting procedures but often produces better results . See Cudd_SupersetShortPaths for a description of the threshold and nvars parameters . Returns a pointer to the result if successful ; NULL otherwise . ]
DdNode *
Cudd_SupersetCompress(
  DdManager * dd ,
  DdNode * f ,
  int  nvars ,
  int  threshold )
{
    DdNode *subset;
    subset = Cudd_SubsetCompress(dd, Cudd_Not(f),nvars,threshold);
    return(Cudd_NotCond(subset, (subset != NULL)));
}
DdNode * Cudd_SupersetCompress ( DdManager * dd , DdNode * f , int nvars , int threshold ) { DdNode * subset ; subset = Cudd_SubsetCompress ( dd , Cudd_Not ( f ) , nvars , threshold ) ; return ( Cudd_NotCond ( subset , ( subset != NULL ) ) ) ; }
Function
Synopsis    [Find a dense superset of BDD <code>f</code>.]
Function Synopsis [ Find a dense superset of BDD <code > f< / code > . ]
/* manager */ /* BDD whose superset is sought */ /* number of variables in the support of f */ /* maximum number of nodes in the superset */