MispRanking
org.ddolibscala.example.misp.MispRanking
class MispRanking extends StateRanking[BitSet]
Implements a ranking strategy for states in the Maximum Independent Set Problem (MISP).
The ranking is based on the number of remaining nodes in the state: a state with more remaining nodes is considered more promising for exploration in a decision diagram.
Attributes
- Graph
-
- Supertypes
-
trait StateRanking[BitSet]trait StateRanking[BitSet]trait Comparator[BitSet]class Objecttrait Matchableclass AnyShow all
Members list
Value members
Concrete methods
Defines how to compare two states.
Defines how to compare two states.
Value parameters
- state1
-
the first state to compare
- state2
-
the second state to compare
Attributes
- Returns
-
a value
xwherex < 0 if state1 < state2 x == 0 if state1 == state2 x > 0 if state1 > state2 - Definition Classes
Inherited methods
Used by the solver. The java method called to compare two states.
Used by the solver. The java method called to compare two states.
Attributes
- Definition Classes
-
StateRanking -> Comparator
- Inherited from:
- StateRanking
Attributes
- Inherited from:
- Comparator
def thenComparing[U <: Comparable[_ >: U <: <FromJavaObject>]](x$0: Function[_ >: BitSet <: <FromJavaObject>, _ <: U]): Comparator[BitSet]
Attributes
- Inherited from:
- Comparator
def thenComparing[U <: <FromJavaObject>](x$0: Function[_ >: BitSet <: <FromJavaObject>, _ <: U], x$1: Comparator[_ >: U <: <FromJavaObject>]): Comparator[BitSet]
Attributes
- Inherited from:
- Comparator
Attributes
- Inherited from:
- Comparator
Attributes
- Inherited from:
- Comparator
Attributes
- Inherited from:
- Comparator
Attributes
- Inherited from:
- Comparator
In this article