|
||||||||||
PREV CLASS NEXT CLASS | FRAMES NO FRAMES | |||||||||
SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |
java.lang.Objectnl.uu.cs.treewidth.algorithm.TreewidthDP<D>
public class TreewidthDP<D extends GraphInput.InputData>
Constructor Summary | |
---|---|
TreewidthDP()
Create an instance of the DP algorithm with the trivial upperbound of n-1. |
|
TreewidthDP(int upperBound)
Create an instance of the DP algorithm with a known upperbound. |
|
TreewidthDP(UpperBound<D> ubAlg)
Create an instance of the DP algorithm and use the supplied upperbound algorithm to calculate the initial upperbound. |
Method Summary | |
---|---|
java.lang.String |
getName()
Every algorithm has a name. |
int |
getTreewidth()
Returns the found treewidth. |
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 TreewidthDP()
public TreewidthDP(int upperBound)
upperBound
- A known upperbound for the graph.public TreewidthDP(UpperBound<D> ubAlg)
ubAlg
- The upperbound algorithm to use.Method Detail |
---|
public int getTreewidth()
Exact
getTreewidth
in interface Exact<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>
|
||||||||||
PREV CLASS NEXT CLASS | FRAMES NO FRAMES | |||||||||
SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |