|
||||||||||
PREV CLASS NEXT CLASS | FRAMES NO FRAMES | |||||||||
SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |
java.lang.Objectnl.uu.cs.treewidth.algorithm.MaximumCardinalitySearchMinimal<D>
public class MaximumCardinalitySearchMinimal<D extends GraphInput.InputData>
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
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 |
---|
public MaximumCardinalitySearchMinimal()
Method Detail |
---|
public NVertexOrder<D> getPermutation()
getPermutation
in interface Permutation<D extends GraphInput.InputData>
public java.lang.String getName()
Algorithm
getName
in interface Algorithm<D extends GraphInput.InputData>
public void setInput(NGraph<D> g)
Algorithm
setInput
in interface Algorithm<D extends GraphInput.InputData>
g
- The graph in standard graph format.public void run()
Algorithm
run
in interface Algorithm<D extends GraphInput.InputData>
public void goRecursive(NVertex<nl.uu.cs.treewidth.algorithm.MaximumCardinalitySearchMinimal.MCSMData> v, int w)
|
||||||||||
PREV CLASS NEXT CLASS | FRAMES NO FRAMES | |||||||||
SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |