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

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

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

Triangulation by using the elimination scheme found by applying the LEX-P algorithm. These triangulations are not necessarily minimal. Sourcepaper: A Note on Lexicographic Breadth First Search for Chordal Graphs by Klaus Simon

Author:
team tw

Constructor Summary
LexBFS()
           
 
Method Summary
 java.lang.String getName()
          Every algorithm has a name.
 NVertexOrder<D> getPermutation()
           
 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

LexBFS

public LexBFS()
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()
Method runs the algorithm and sets the permutation.

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