Package com.jgalgo.alg.cover

Class DominatingSetAlgoAbstract

java.lang.Object

com.jgalgo.alg.cover.DominatingSetAlgoAbstract

All Implemented Interfaces:

DominatingSetAlgo

Direct Known Subclasses:

DominatingSetAlgoGreedy

public abstract class DominatingSetAlgoAbstract
extends Object
implements DominatingSetAlgo

Abstract class for computing a minimum dominating set.

The class implements the interface by solving the problem on the index graph and then maps the results back to the original graph. The implementation for index graphs is abstract and left to the subclasses.

Author:

Barak Ugav

Constructor Summary

Constructors

Constructor	Description
DominatingSetAlgoAbstract()	Default constructor.

Method Summary

Modifier and Type	Method	Description
<V, E> Set<V>	computeMinimumDominationSet(Graph<V,E> g, WeightFunction<V> w, EdgeDirection dominanceDirection)	Compute a minimum dominating set of the graph with respect to the given edges direction.

Methods inherited from class java.lang.Object

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

Methods inherited from interface com.jgalgo.alg.cover.DominatingSetAlgo

computeMinimumDominationSet

Constructor Details

DominatingSetAlgoAbstract

public DominatingSetAlgoAbstract()

Default constructor.

Method Details

computeMinimumDominationSet

public <V,
E> Set<V> computeMinimumDominationSet(Graph<V,E> g,
 WeightFunction<V> w,
 EdgeDirection dominanceDirection)

Description copied from interface: DominatingSetAlgo

Compute a minimum dominating set of the graph with respect to the given edges direction.

Specified by:

computeMinimumDominationSet in interface DominatingSetAlgo

Type Parameters:

V - the vertices type

E - the edges type

Parameters:

g - a graph

w - a vertex weight function

dominanceDirection - the direction of the edges to consider

Returns:

a minimum dominating set of the graph