nl.uu.cs.treewidth.algorithm
Class MaximumCardinalitySearchMinimal<D extends GraphInput.InputData>

java.lang.Object
  extended by nl.uu.cs.treewidth.algorithm.MaximumCardinalitySearchMinimal<D>
All Implemented Interfaces:
Algorithm<D>, Permutation<D>

public class MaximumCardinalitySearchMinimal<D extends GraphInput.InputData>
extends java.lang.Object
implements Permutation<D>

Triangulation obtained by using the elimination scheme produced by the MCS (Maximum Cardinality Search) algorithm of Berry et al. This is a version of MCS that produces minimal triangulations. Reference paper: Maximum Cardinality Search for Computing Minimal Triangulations Anne Berry, Jean R. S. Blair, and Pinar Heggernes

Author:
tw team

Constructor Summary
MaximumCardinalitySearchMinimal()
           
 
Method Summary
 java.lang.String getName()
          Every algorithm has a name.
 NVertexOrder<D> getPermutation()
           
 void goRecursive(NVertex<nl.uu.cs.treewidth.algorithm.MaximumCardinalitySearchMinimal.MCSMData> v, int w)
           
 void run()
          Does the actual computation of the algorithm.
 void setInput(NGraph<D> g)
          Sets the input the algorithm will run on.
 
Methods inherited from class java.lang.Object
equals, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait
 

Constructor Detail

MaximumCardinalitySearchMinimal

public MaximumCardinalitySearchMinimal()
Method Detail

getPermutation

public NVertexOrder<D> getPermutation()
Specified by:
getPermutation in interface Permutation<D extends GraphInput.InputData>
Returns:
The computed permutation of the vertices.

getName

public java.lang.String getName()
Description copied from interface: Algorithm
Every algorithm has a name. This is for identification towards the user.

Specified by:
getName in interface Algorithm<D extends GraphInput.InputData>
Returns:
Name of the algorithm.

setInput

public void setInput(NGraph<D> g)
Description copied from interface: Algorithm
Sets the input the algorithm will run on.

Specified by:
setInput in interface Algorithm<D extends GraphInput.InputData>
Parameters:
g - The graph in standard graph format.

run

public void run()
Description copied from interface: Algorithm
Does the actual computation of the algorithm. The result is remembered but not returned. Get it using the appropriate return function (getUpperbound(), getLowerBound(), etc.).
Only works after setInput has been called.

Specified by:
run in interface Algorithm<D extends GraphInput.InputData>

goRecursive

public void goRecursive(NVertex<nl.uu.cs.treewidth.algorithm.MaximumCardinalitySearchMinimal.MCSMData> v,
                        int w)