nl.uu.cs.treewidth.algorithm
Interface LowerBound<D extends GraphInput.InputData>
- All Superinterfaces:
- Algorithm<D>
- All Known Implementing Classes:
- AllStartMaximumCardinalitySearch, AllStartMaximumMinimumDegree, AllStartMaximumMinimumDegreePlusLeastC, AllStartMinorMinWidth, MaximumCardinalitySearch, MaximumMinimumDegree, MaximumMinimumDegreePlusLeastC, MaximumMinimumDegreePlusMaxD, MaximumMinimumDegreePlusMinD, MinDegree, MinorMinWidth, Ramachandramurthi
public interface LowerBound<D extends GraphInput.InputData>
- extends Algorithm<D>
Interface for algorithms that compute a lowerbound.
getLowerBound()
must always return
a valid lowerbound, even if run() has not been called yet.
(Note that -infty is always a valid lowerbound; use
Integer.MIN_VALUE
to represent it.)
- Author:
- tw team
getLowerBound
int getLowerBound()
- Returns:
- A valid lowerbound. See class documentation for
details.