org.jgrapht.alg.interfaces.IndependentSetAlgorithm Maven / Gradle / Ivy
The newest version!
/*
* (C) Copyright 2018-2023, by Joris Kinable and Contributors.
*
* JGraphT : a free Java graph-theory library
*
* See the CONTRIBUTORS.md file distributed with this work for additional
* information regarding copyright ownership.
*
* This program and the accompanying materials are made available under the
* terms of the Eclipse Public License 2.0 which is available at
* http://www.eclipse.org/legal/epl-2.0, or the
* GNU Lesser General Public License v2.1 or later
* which is available at
* http://www.gnu.org/licenses/old-licenses/lgpl-2.1-standalone.html.
*
* SPDX-License-Identifier: EPL-2.0 OR LGPL-2.1-or-later
*/
package org.jgrapht.alg.interfaces;
import org.jgrapht.util.*;
import java.util.*;
/**
* Algorithm to compute an
* Independent Set in a graph.
*
* @param vertex the graph vertex type
*
* @author Joris Kinable
*/
public interface IndependentSetAlgorithm
{
/**
* Computes an independent set; all vertices are considered to have equal weight.
*
* @return a vertex independent set
*/
IndependentSet getIndependentSet();
/**
* A (weighted) Independent
* Set
*
* @param the vertex type
*/
interface IndependentSet
extends Set
{
/**
* Returns the weight of the independent set. When solving a weighted independent set
* problem, the weight returned is the sum of the weights of the vertices in the independent
* set. When solving the unweighted variant, the cardinality of the independent set is
* returned instead.
*
* @return weight of the independent set
*/
double getWeight();
}
/**
* Default implementation of a (weighted) independent set
*
* @param the vertex type
*/
class IndependentSetImpl
extends WeightedUnmodifiableSet
implements IndependentSet
{
private static final long serialVersionUID = 4572451196544323306L;
public IndependentSetImpl(Set independentSet)
{
super(independentSet);
}
public IndependentSetImpl(Set independentSet, double weight)
{
super(independentSet, weight);
}
}
}