|
||||||||||
PREV CLASS NEXT CLASS | FRAMES NO FRAMES | |||||||||
SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |
java.lang.Objectnl.uu.cs.treewidth.algorithm.AllStartLexBFS<D>
public class AllStartLexBFS<D extends GraphInput.InputData>
Triangulation by using the elimination scheme found by applying the LEX-P algorithm. These triangulations are not necessarily minimal. This All Start Version is run n times; everytime selecting a different vertex to start with. Sourcepaper: A Note on Lexicographic Breadth First Search for Chordal Graphs by Klaus Simon
Constructor Summary | |
---|---|
AllStartLexBFS()
|
Method Summary | |
---|---|
java.lang.String |
getName()
Every algorithm has a name. |
NVertexOrder<D> |
getPermutation()
|
int |
getUpperBound()
Returns the upperbound. |
void |
run()
Method runs the algorithm and sets the permutation. |
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 AllStartLexBFS()
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 input graphpublic void run()
run
in interface Algorithm<D extends GraphInput.InputData>
public int getUpperBound()
UpperBound
getUpperBound
in interface UpperBound<D extends GraphInput.InputData>
|
||||||||||
PREV CLASS NEXT CLASS | FRAMES NO FRAMES | |||||||||
SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |