Generated on Thu Nov 2 14:49:40 2006 for Gecode/J by doxygen 1.5.0

org.gecode.BABSearch Class Reference
[Search engines]

List of all members.

Detailed Description

Depth-first branch-and-bound search engine.

This is an optimizing search engine. When a new solution is found, the next solution is constrained to be better according to the constrain-method of the script.

Acts as an iterator over the solutions to the root space. Each solution returned is better than the previous solution, which means that the optimal solution is the last solution returned.

Definition at line 23 of file BABSearch.java.

Public Member Functions

void delete ()
synchronized JavaSpace next ()
 Return next better solution.
 BABSearch (JavaSpace s, int c_d, int a_d, Stop st)
 Initialize search engine with s as root.
 BABSearch (JavaSpace s, int c_d, int a_d)
 Initialize search engine with s as root.
 BABSearch (JavaSpace s, int c_d)
 Initialize search engine with s as root.
 BABSearch (JavaSpace s)
 Initialize search engine with s as root.
synchronized JavaSpace next_internal ()
 Return next better solution.
synchronized Statistics statistics ()
 Return next better solution.

Protected Member Functions

 BABSearch (long cPtr, boolean cMemoryOwn)
void finalize ()

Static Protected Member Functions

static long getCPtr (BABSearch obj)

Protected Attributes

boolean swigCMemOwn


Constructor & Destructor Documentation

org.gecode.BABSearch.BABSearch ( long  cPtr,
boolean  cMemoryOwn 
) [protected]

Definition at line 27 of file BABSearch.java.

org.gecode.BABSearch.BABSearch ( JavaSpace  s,
int  c_d,
int  a_d,
Stop  st 
)

Initialize search engine with s as root.

The optional parameters c_d and a_d represent copying recomputation distance and adaptive recomputation distance respectively.

Definition at line 61 of file BABSearch.java.

org.gecode.BABSearch.BABSearch ( JavaSpace  s,
int  c_d,
int  a_d 
)

Initialize search engine with s as root.

The optional parameters c_d and a_d represent copying recomputation distance and adaptive recomputation distance respectively.

Definition at line 70 of file BABSearch.java.

org.gecode.BABSearch.BABSearch ( JavaSpace  s,
int  c_d 
)

Initialize search engine with s as root.

The optional parameters c_d and a_d represent copying recomputation distance and adaptive recomputation distance respectively.

Definition at line 79 of file BABSearch.java.

org.gecode.BABSearch.BABSearch ( JavaSpace  s  ) 

Initialize search engine with s as root.

The optional parameters c_d and a_d represent copying recomputation distance and adaptive recomputation distance respectively.

Definition at line 88 of file BABSearch.java.


Member Function Documentation

static long org.gecode.BABSearch.getCPtr ( BABSearch  obj  )  [static, protected]

Definition at line 32 of file BABSearch.java.

void org.gecode.BABSearch.finalize (  )  [protected]

Definition at line 36 of file BABSearch.java.

void org.gecode.BABSearch.delete (  ) 

Definition at line 40 of file BABSearch.java.

synchronized JavaSpace org.gecode.BABSearch.next (  ) 

Return next better solution.

Definition at line 49 of file BABSearch.java.

synchronized JavaSpace org.gecode.BABSearch.next_internal (  ) 

Return next better solution.

Definition at line 94 of file BABSearch.java.

synchronized Statistics org.gecode.BABSearch.statistics (  ) 

Return next better solution.

Definition at line 100 of file BABSearch.java.


Member Data Documentation

boolean org.gecode.BABSearch.swigCMemOwn [protected]

Definition at line 25 of file BABSearch.java.


The documentation for this class was generated from the following file: