A B C D E F G H I J L M N O P Q R S T U V W

G

get() - Method in class nl.uu.cs.treewidth.input.CliqueGraphGenerator
 
get() - Method in class nl.uu.cs.treewidth.input.DgfReader
 
get() - Method in interface nl.uu.cs.treewidth.input.GraphInput
Return a graph.
get() - Method in class nl.uu.cs.treewidth.input.GridGraphGenerator
 
get() - Method in class nl.uu.cs.treewidth.input.NKnightGraphGenerator
 
get() - Method in class nl.uu.cs.treewidth.input.NQueenGraphGenerator
 
get() - Method in class nl.uu.cs.treewidth.input.RandomGraphGenerator
 
get() - Method in class nl.uu.cs.treewidth.input.StarGraphGenerator
 
getClasses(String) - Static method in class nl.uu.cs.treewidth.AlgoTester
 
getComments() - Method in class nl.uu.cs.treewidth.graph.Graph
Deprecated.  
getComments() - Method in class nl.uu.cs.treewidth.graph.NeighborHashSetGraph
Deprecated.  
getComments() - Method in class nl.uu.cs.treewidth.ngraph.NGraph
 
getData(int) - Method in class nl.uu.cs.treewidth.graph.ElimFriendlyGraph
Deprecated.  
getDecomposition() - Method in interface nl.uu.cs.treewidth.algorithm.Constructive
Returns the found tree decomposition.
getDecomposition() - Method in class nl.uu.cs.treewidth.algorithm.PermutationGuesser
 
getDecomposition() - Method in class nl.uu.cs.treewidth.algorithm.PermutationToTreeDecomposition
 
getEdges() - Method in class nl.uu.cs.treewidth.graph.Graph
Deprecated. Computes the edgelist of the graph.
getEdges() - Method in class nl.uu.cs.treewidth.graph.NeighborHashSetGraph
Deprecated. Computes the edgelist of the graph.
getLowerBound() - Method in class nl.uu.cs.treewidth.algorithm.AllStartMaximumCardinalitySearch
 
getLowerBound() - Method in class nl.uu.cs.treewidth.algorithm.AllStartMaximumMinimumDegree
 
getLowerBound() - Method in class nl.uu.cs.treewidth.algorithm.AllStartMaximumMinimumDegreePlusLeastC
 
getLowerBound() - Method in class nl.uu.cs.treewidth.algorithm.AllStartMinorMinWidth
 
getLowerBound() - Method in class nl.uu.cs.treewidth.algorithm.AllStartMinorMinWidth_QuickBB
 
getLowerBound() - Method in interface nl.uu.cs.treewidth.algorithm.LowerBound
 
getLowerBound() - Method in class nl.uu.cs.treewidth.algorithm.MaximumCardinalitySearch
 
getLowerBound() - Method in class nl.uu.cs.treewidth.algorithm.MaximumMinimumDegree
 
getLowerBound() - Method in class nl.uu.cs.treewidth.algorithm.MaximumMinimumDegreePlusLeastC
 
getLowerBound() - Method in class nl.uu.cs.treewidth.algorithm.MaximumMinimumDegreePlusMaxD
 
getLowerBound() - Method in class nl.uu.cs.treewidth.algorithm.MaximumMinimumDegreePlusMinD
 
getLowerBound() - Method in class nl.uu.cs.treewidth.algorithm.MaximumMinimumDegreePlusMinD2
 
getLowerBound() - Method in class nl.uu.cs.treewidth.algorithm.MinDegree
 
getLowerBound() - Method in class nl.uu.cs.treewidth.algorithm.MinorMinWidth
 
getLowerBound() - Method in class nl.uu.cs.treewidth.algorithm.MinorMinWidth_QuickBB
 
getLowerBound() - Method in class nl.uu.cs.treewidth.algorithm.Ramachandramurthi
 
getName() - Method in interface nl.uu.cs.treewidth.algorithm.Algorithm
Every algorithm has a name.
getName() - Method in class nl.uu.cs.treewidth.algorithm.AllStartLexBFS
 
getName() - Method in class nl.uu.cs.treewidth.algorithm.AllStartMaximumCardinalitySearch
 
getName() - Method in class nl.uu.cs.treewidth.algorithm.AllStartMaximumCardinalitySearchMinimal
 
getName() - Method in class nl.uu.cs.treewidth.algorithm.AllStartMaximumMinimumDegree
 
getName() - Method in class nl.uu.cs.treewidth.algorithm.AllStartMaximumMinimumDegreePlusLeastC
 
getName() - Method in class nl.uu.cs.treewidth.algorithm.AllStartMinorMinWidth
 
getName() - Method in class nl.uu.cs.treewidth.algorithm.AllStartMinorMinWidth_QuickBB
 
getName() - Method in class nl.uu.cs.treewidth.algorithm.GreedyDegree
 
getName() - Method in class nl.uu.cs.treewidth.algorithm.GreedyFillIn
 
getName() - Method in class nl.uu.cs.treewidth.algorithm.LexBFS
 
getName() - Method in class nl.uu.cs.treewidth.algorithm.MaximumCardinalitySearch
 
getName() - Method in class nl.uu.cs.treewidth.algorithm.MaximumCardinalitySearchMinimal
 
getName() - Method in class nl.uu.cs.treewidth.algorithm.MaximumMinimumDegree
 
getName() - Method in class nl.uu.cs.treewidth.algorithm.MaximumMinimumDegreePlusLeastC
 
getName() - Method in class nl.uu.cs.treewidth.algorithm.MaximumMinimumDegreePlusMaxD
 
getName() - Method in class nl.uu.cs.treewidth.algorithm.MaximumMinimumDegreePlusMinD
 
getName() - Method in class nl.uu.cs.treewidth.algorithm.MaximumMinimumDegreePlusMinD2
 
getName() - Method in class nl.uu.cs.treewidth.algorithm.MinDegree
 
getName() - Method in class nl.uu.cs.treewidth.algorithm.MinorMinWidth
 
getName() - Method in class nl.uu.cs.treewidth.algorithm.MinorMinWidth_QuickBB
 
getName() - Method in class nl.uu.cs.treewidth.algorithm.PermutationGuesser
 
getName() - Method in class nl.uu.cs.treewidth.algorithm.PermutationToTreeDecomposition
 
getName() - Method in class nl.uu.cs.treewidth.algorithm.PreProcessor
 
getName() - Method in class nl.uu.cs.treewidth.algorithm.QuickBB
 
getName() - Method in class nl.uu.cs.treewidth.algorithm.Ramachandramurthi
 
getName() - Method in class nl.uu.cs.treewidth.algorithm.TreewidthDP
 
getName() - Method in interface nl.uu.cs.treewidth.graph.VertexOrder.NamedData
Deprecated.  
getNeighbors() - Method in class nl.uu.cs.treewidth.ngraph.HashVertex
 
getNeighbors() - Method in class nl.uu.cs.treewidth.ngraph.ListVertex
 
getNeighbors() - Method in class nl.uu.cs.treewidth.ngraph.NVertex
 
getNeighbours(int) - Method in class nl.uu.cs.treewidth.graph.ElimFriendlyGraph
Deprecated.  
getNeighbours_(int, int[]) - Method in class nl.uu.cs.treewidth.graph.ElimFriendlyGraph
Deprecated.  
getNonEliminatedVertices() - Method in class nl.uu.cs.treewidth.graph.ElimFriendlyGraph
Deprecated. Beware: pretty nasty performance.
getNumberOfEdges() - Method in class nl.uu.cs.treewidth.ngraph.NGraph
 
getNumberOfNeighbors() - Method in class nl.uu.cs.treewidth.ngraph.HashVertex
 
getNumberOfNeighbors() - Method in class nl.uu.cs.treewidth.ngraph.ListVertex
 
getNumberOfNeighbors() - Method in class nl.uu.cs.treewidth.ngraph.NVertex
 
getNumberOfVertices() - Method in class nl.uu.cs.treewidth.ngraph.ListGraph
 
getNumberOfVertices() - Method in class nl.uu.cs.treewidth.ngraph.NGraph
 
getOriginal() - Method in class nl.uu.cs.treewidth.graph.VertexData
Deprecated.  
getPermutation() - Method in class nl.uu.cs.treewidth.algorithm.AllStartLexBFS
 
getPermutation() - Method in class nl.uu.cs.treewidth.algorithm.AllStartMaximumCardinalitySearch
 
getPermutation() - Method in class nl.uu.cs.treewidth.algorithm.AllStartMaximumCardinalitySearchMinimal
 
getPermutation() - Method in class nl.uu.cs.treewidth.algorithm.GreedyDegree
 
getPermutation() - Method in class nl.uu.cs.treewidth.algorithm.GreedyFillIn
 
getPermutation() - Method in class nl.uu.cs.treewidth.algorithm.LexBFS
 
getPermutation() - Method in class nl.uu.cs.treewidth.algorithm.MaximumCardinalitySearch
 
getPermutation() - Method in class nl.uu.cs.treewidth.algorithm.MaximumCardinalitySearchMinimal
 
getPermutation() - Method in interface nl.uu.cs.treewidth.algorithm.Permutation
 
getPermutation() - Method in class nl.uu.cs.treewidth.algorithm.QuickBB
 
getSimplicialVertex() - Method in class nl.uu.cs.treewidth.ngraph.NGraph
 
getSimplicialVertices() - Method in class nl.uu.cs.treewidth.graph.NeighborHashSetGraph
Deprecated.  
getTime() - Method in class nl.uu.cs.treewidth.timing.Stopwatch
 
getTreewidth() - Method in interface nl.uu.cs.treewidth.algorithm.Exact
Returns the found treewidth.
getTreewidth() - Method in class nl.uu.cs.treewidth.algorithm.TreewidthDP
 
getUpperBound() - Method in class nl.uu.cs.treewidth.algorithm.AllStartLexBFS
 
getUpperBound() - Method in class nl.uu.cs.treewidth.algorithm.GreedyDegree
 
getUpperBound() - Method in class nl.uu.cs.treewidth.algorithm.GreedyFillIn
 
getUpperBound() - Method in class nl.uu.cs.treewidth.algorithm.PermutationGuesser
 
getUpperBound() - Method in class nl.uu.cs.treewidth.algorithm.PermutationToTreeDecomposition
 
getUpperBound() - Method in class nl.uu.cs.treewidth.algorithm.QuickBB
 
getUpperBound() - Method in interface nl.uu.cs.treewidth.algorithm.UpperBound
Returns the upperbound.
getVertex(int) - Method in class nl.uu.cs.treewidth.ngraph.ListGraph
 
getVertex(int) - Method in class nl.uu.cs.treewidth.ngraph.NGraph
 
getVertices() - Method in class nl.uu.cs.treewidth.ngraph.ListGraph
 
getVertices() - Method in class nl.uu.cs.treewidth.ngraph.NGraph
 
goRecursive(NVertex<AllStartMaximumCardinalitySearchMinimal<D>.MCSMData>, int) - Method in class nl.uu.cs.treewidth.algorithm.AllStartMaximumCardinalitySearchMinimal
 
goRecursive(NGraph<D>, int) - Method in class nl.uu.cs.treewidth.algorithm.AllStartMaximumMinimumDegreePlusLeastC
 
goRecursive(NVertex<MaximumCardinalitySearchMinimal<D>.MCSMData>, int) - Method in class nl.uu.cs.treewidth.algorithm.MaximumCardinalitySearchMinimal
 
Graph<Data> - Class in nl.uu.cs.treewidth.graph
Deprecated. 
Graph() - Constructor for class nl.uu.cs.treewidth.graph.Graph
Deprecated. Creates an empty graph with no comments.
Graph(NeighborHashSetGraph<Data>) - Constructor for class nl.uu.cs.treewidth.graph.Graph
Deprecated.  
Graph.Convertor<OldData,NewData> - Interface in nl.uu.cs.treewidth.graph
Deprecated.  
Graph.Copier<CopiedData> - Class in nl.uu.cs.treewidth.graph
Deprecated. Does NOT make a deep copy of the vertices' data.
Graph.Copier() - Constructor for class nl.uu.cs.treewidth.graph.Graph.Copier
Deprecated.  
GraphInput - Interface in nl.uu.cs.treewidth.input
Interface for classes that can return a Graph.
GraphInput.InputData - Class in nl.uu.cs.treewidth.input
 
GraphInput.InputData() - Constructor for class nl.uu.cs.treewidth.input.GraphInput.InputData
 
GraphInput.InputData(int, String) - Constructor for class nl.uu.cs.treewidth.input.GraphInput.InputData
 
GraphViz - Class in nl.uu.cs.treewidth.output
 
GraphViz() - Constructor for class nl.uu.cs.treewidth.output.GraphViz
 
GreedyDegree<D extends GraphInput.InputData> - Class in nl.uu.cs.treewidth.algorithm
The GreedyDegree algorithm computes a permutation and at the same time derives an upperbound.
GreedyDegree() - Constructor for class nl.uu.cs.treewidth.algorithm.GreedyDegree
 
GreedyDegree.GreedyData - Class in nl.uu.cs.treewidth.algorithm
 
GreedyDegree.GreedyData(NVertex<D>) - Constructor for class nl.uu.cs.treewidth.algorithm.GreedyDegree.GreedyData
 
GreedyFillIn<D extends GraphInput.InputData> - Class in nl.uu.cs.treewidth.algorithm
The GreedyFillIn algorithm computes a permutation and at the same time derives an upperbound.
GreedyFillIn() - Constructor for class nl.uu.cs.treewidth.algorithm.GreedyFillIn
 
GreedyFillIn(boolean) - Constructor for class nl.uu.cs.treewidth.algorithm.GreedyFillIn
 
GreedyFillIn.GreedyData - Class in nl.uu.cs.treewidth.algorithm
 
GreedyFillIn.GreedyData(NVertex<D>) - Constructor for class nl.uu.cs.treewidth.algorithm.GreedyFillIn.GreedyData
 
GridGraphGenerator - Class in nl.uu.cs.treewidth.input
 
GridGraphGenerator(int, int) - Constructor for class nl.uu.cs.treewidth.input.GridGraphGenerator
 

A B C D E F G H I J L M N O P Q R S T U V W