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

  Synopsis    [Reads the current number of crossovers used by the
  genetic algorithm for reordering.]

  Description [Reads the current number of crossovers used by the
  genetic algorithm for variable reordering. A larger number of crossovers will
  cause the genetic algorithm to take more time, but will generally
  produce better results. The default value is 0, in which case the
  package uses three times the number of variables as number of crossovers,
  with a maximum of 60.]

  SideEffects [None]

  SeeAlso     [Cudd_SetNumberXovers]

******************************************************************************/
Function
Synopsis    [Reads the current number of crossovers used by the
genetic algorithm for reordering.]

Description [Reads the current number of crossovers used by the
genetic algorithm for variable reordering. A larger number of crossovers will
cause the genetic algorithm to take more time, but will generally
produce better results. The default value is 0, in which case the
package uses three times the number of variables as number of crossovers,
with a maximum of 60.]




Function Synopsis [ Reads the current number of crossovers used by the genetic algorithm for reordering . ] Description [ Reads the current number of crossovers used by the genetic algorithm for variable reordering . A larger number of crossovers will cause the genetic algorithm to take more time but will generally produce better results . The default value is 0 in which case the package uses three times the number of variables as number of crossovers with a maximum of 60 . ]
int
Cudd_ReadNumberXovers(
  DdManager * dd)
{
    return(dd->numberXovers);
}
int Cudd_ReadNumberXovers ( DdManager * dd ) { return ( dd -> numberXovers ) ; }
Function
Synopsis    [Reads the current number of crossovers used by the
genetic algorithm for reordering.]
Function Synopsis [ Reads the current number of crossovers used by the genetic algorithm for reordering . ]