Overview
Package
Class
Use
Tree
Deprecated
Index
Help
PREV LETTER
NEXT LETTER
FRAMES
NO FRAMES
All Classes
A
B
C
D
E
F
G
H
I
J
L
M
N
O
P
Q
R
S
T
U
V
W
R
Ramachandramurthi
<
D
extends
GraphInput.InputData
> - Class in
nl.uu.cs.treewidth.algorithm
The 'Ramachandramurthi' lower bound.
Ramachandramurthi()
- Constructor for class nl.uu.cs.treewidth.algorithm.
Ramachandramurthi
Starts out as a lowerbound of -infty; improved to the mindegree lowerbound once run() is called.
RandomGraphGenerator
- Class in
nl.uu.cs.treewidth.input
RandomGraphGenerator(int, double)
- Constructor for class nl.uu.cs.treewidth.input.
RandomGraphGenerator
remove()
- Method in class nl.uu.cs.treewidth.ngraph.
BorkIterator
removeEdge(int, int)
- Method in class nl.uu.cs.treewidth.graph.
ElimFriendlyGraph
Deprecated.
removeEdge(Edge<Data>)
- Method in class nl.uu.cs.treewidth.graph.
Graph
Deprecated.
Removes an edge from the edgelist of it's two vertices
removeEdge(NeighborHashSetEdge<Data>)
- Method in class nl.uu.cs.treewidth.graph.
NeighborHashSetGraph
Deprecated.
removeNeighbor(NVertex<D>)
- Method in class nl.uu.cs.treewidth.ngraph.
HashVertex
removeNeighbor(NVertex<D>)
- Method in class nl.uu.cs.treewidth.ngraph.
ListVertex
removeNeighbor(NVertex<D>)
- Method in class nl.uu.cs.treewidth.ngraph.
NVertex
removeVertex(NVertex<QuickBB<D>.QuickBBData>)
- Method in class nl.uu.cs.treewidth.algorithm.
AllStartMinorMinWidth_QuickBB
removeVertex(NVertex<QuickBB<D>.QuickBBData>)
- Method in class nl.uu.cs.treewidth.algorithm.
MinorMinWidth_QuickBB
This method removes the vertex from the copies of the neigborlists of its neighbors and clears it's own neighborlist copy.
removeVertex(Vertex<Data>)
- Method in class nl.uu.cs.treewidth.graph.
Graph
Deprecated.
removeVertex(NeighborHashSetVertex<Data>)
- Method in class nl.uu.cs.treewidth.graph.
NeighborHashSetGraph
Deprecated.
removeVertex(NVertex<D>)
- Method in class nl.uu.cs.treewidth.ngraph.
ListGraph
removeVertex(NVertex<D>)
- Method in class nl.uu.cs.treewidth.ngraph.
NGraph
render(String)
- Static method in class nl.uu.cs.treewidth.output.
GraphViz
reset()
- Method in class nl.uu.cs.treewidth.timing.
Stopwatch
ResultChecker
- Class in
nl.uu.cs.treewidth.testing
ResultChecker()
- Constructor for class nl.uu.cs.treewidth.testing.
ResultChecker
ResultChecker.AlgoCreator
<
D
extends
GraphInput.InputData
> - Interface in
nl.uu.cs.treewidth.testing
ResultChecker.Test
- Class in
nl.uu.cs.treewidth.testing
ResultChecker.TestType
- Enum in
nl.uu.cs.treewidth.testing
run()
- Method in interface nl.uu.cs.treewidth.algorithm.
Algorithm
Does the actual computation of the algorithm.
run()
- Method in class nl.uu.cs.treewidth.algorithm.
AllStartLexBFS
Method runs the algorithm and sets the permutation.
run()
- Method in class nl.uu.cs.treewidth.algorithm.
AllStartMaximumCardinalitySearch
run()
- Method in class nl.uu.cs.treewidth.algorithm.
AllStartMaximumCardinalitySearchMinimal
run()
- Method in class nl.uu.cs.treewidth.algorithm.
AllStartMaximumMinimumDegree
run()
- Method in class nl.uu.cs.treewidth.algorithm.
AllStartMaximumMinimumDegreePlusLeastC
run()
- Method in class nl.uu.cs.treewidth.algorithm.
AllStartMinorMinWidth
run()
- Method in class nl.uu.cs.treewidth.algorithm.
AllStartMinorMinWidth_QuickBB
run()
- Method in class nl.uu.cs.treewidth.algorithm.
GreedyDegree
run()
- Method in class nl.uu.cs.treewidth.algorithm.
GreedyFillIn
run()
- Method in class nl.uu.cs.treewidth.algorithm.
LexBFS
Method runs the algorithm and sets the permutation.
run()
- Method in class nl.uu.cs.treewidth.algorithm.
MaximumCardinalitySearch
run()
- Method in class nl.uu.cs.treewidth.algorithm.
MaximumCardinalitySearchMinimal
run()
- Method in class nl.uu.cs.treewidth.algorithm.
MaximumMinimumDegree
run()
- Method in class nl.uu.cs.treewidth.algorithm.
MaximumMinimumDegreePlusLeastC
run()
- Method in class nl.uu.cs.treewidth.algorithm.
MaximumMinimumDegreePlusMaxD
run()
- Method in class nl.uu.cs.treewidth.algorithm.
MaximumMinimumDegreePlusMinD
run()
- Method in class nl.uu.cs.treewidth.algorithm.
MaximumMinimumDegreePlusMinD2
run()
- Method in class nl.uu.cs.treewidth.algorithm.
MinDegree
run()
- Method in class nl.uu.cs.treewidth.algorithm.
MinorMinWidth
Method runs the algorithm and sets the lowerbound.
run()
- Method in class nl.uu.cs.treewidth.algorithm.
MinorMinWidth_QuickBB
Method runs the algorithm and sets the lowerbound.
run()
- Method in class nl.uu.cs.treewidth.algorithm.
PermutationGuesser
run()
- Method in class nl.uu.cs.treewidth.algorithm.
PermutationToTreeDecomposition
run()
- Method in class nl.uu.cs.treewidth.algorithm.
PreProcessor
run()
- Method in class nl.uu.cs.treewidth.algorithm.
QuickBB
run()
- Method in class nl.uu.cs.treewidth.algorithm.
Ramachandramurthi
Method runs the algorithm and sets the lowerbound.
run()
- Method in class nl.uu.cs.treewidth.algorithm.
TreewidthDP
Runny
- Class in
nl.uu.cs.treewidth
Runny()
- Constructor for class nl.uu.cs.treewidth.
Runny
Overview
Package
Class
Use
Tree
Deprecated
Index
Help
PREV LETTER
NEXT LETTER
FRAMES
NO FRAMES
All Classes
A
B
C
D
E
F
G
H
I
J
L
M
N
O
P
Q
R
S
T
U
V
W