minicp.search

Class LimitedDiscrepancyBranching

java.lang.Object

minicp.search.LimitedDiscrepancyBranching

All Implemented Interfaces:

Supplier<Procedure[]>

public class LimitedDiscrepancyBranching
extends Object
implements Supplier<Procedure[]>

Branching combinator that ensures that that the alternatives created are always within the discrepancy limit. The discrepancy of an alternative generated for a given node is the distance from the left most alternative. The discrepancy of a node is the sum of the discrepancy of its ancestors.

Constructor Summary

Constructors

Constructor and Description
LimitedDiscrepancyBranching(Supplier<Procedure[]> branching, int maxDiscrepancy) Creates a discprepancy combinator on a given branching.

Method Summary

Modifier and Type	Method and Description
Procedure[]	get()

Methods inherited from class java.lang.Object

clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Constructor Detail

LimitedDiscrepancyBranching

public LimitedDiscrepancyBranching(Supplier<Procedure[]> branching,
                                   int maxDiscrepancy)

Creates a discprepancy combinator on a given branching.

Parameters:

branching - the branching on which to apply the discrepancy combinator

maxDiscrepancy - the maximum discrepancy limit. Any node exceeding that limit is pruned.

Method Detail

get

public Procedure[] get()

Specified by:

get in interface Supplier<Procedure[]>