MispProblem

org.ddolibscala.example.misp.MispProblem
See theMispProblem companion class
object MispProblem

Companion object of the MispProblem class.

Attributes

Companion
class
Graph
Supertypes
class Object
trait Matchable
class Any
Self type

Members list

Value members

Concrete methods

def apply(nodes: BitSet, neighbors: Array[BitSet], weights: Array[Int], optimal: Option[Double] = ...): MispProblem

Returns an instance of the Maximum Independent Set Problem (MISP) as a org.ddolibscala.modeling.Problem.

Returns an instance of the Maximum Independent Set Problem (MISP) as a org.ddolibscala.modeling.Problem.

Value parameters

neighbors

adjacency list for each node

nodes

all the nodes of the graph

optimal

the value of the optimal solution if known

weights

weight of each node

Attributes

Returns

an instance of the Maximum Independent Set Problem (MISP) as a org.ddolibscala.modeling.Problem.

def apply(fname: String): MispProblem

Returns an instance of the Maximum Independent Set Problem (MISP) as a org.ddolibscala.modeling.Problem by reading a file.

Returns an instance of the Maximum Independent Set Problem (MISP) as a org.ddolibscala.modeling.Problem by reading a file.

Value parameters

fname

The path to the data file

Attributes

Returns

an instance of the Maximum Independent Set Problem (MISP) as a org.ddolibscala.modeling.Problem.