Module org.maxicp

Package org.maxicp.cp.examples.raw

Class MaxIndependentSet

java.lang.Object

org.maxicp.cp.examples.raw.MaxIndependentSet

public class MaxIndependentSet
extends Object

Max Independent Set Problem of a graph: Given a graph, find the largest set of vertices such that no two vertices in the set are adjacent. This problem is modeled with a set variable

Author:

Amaury Guicchard and Pierre Schaus

Constructor Summary

Constructors

Constructor	Description
MaxIndependentSet()

Method Summary

Modifier and Type	Method	Description
static void	main(String[] args)
static org.maxicp.cp.examples.raw.MaxIndependentSet.Instance	readInstance(String path)

Methods inherited from class java.lang.Object

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

Constructor Details

MaxIndependentSet

public MaxIndependentSet()

Method Details

main

public static void main(String[] args)

readInstance

public static org.maxicp.cp.examples.raw.MaxIndependentSet.Instance readInstance(String path)
                                                                          throws IOException

Throws:

IOException