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
A
a
- Variable in class nl.uu.cs.treewidth.graph.
Edge
Deprecated.
An endpoint of the edge.
a
- Variable in class nl.uu.cs.treewidth.graph.
NeighborHashSetEdge
Deprecated.
An endpoint of the edge.
a
- Variable in class nl.uu.cs.treewidth.ngraph.
NEdge
addComment(String)
- Method in class nl.uu.cs.treewidth.graph.
Graph
Deprecated.
Adds a new line of comments to the graph.
addComment(String)
- Method in class nl.uu.cs.treewidth.graph.
NeighborHashSetGraph
Deprecated.
Adds a new line of comments to the graph.
addComment(String)
- Method in class nl.uu.cs.treewidth.ngraph.
NGraph
addEdge(Vertex<Data>, Vertex<Data>)
- Method in class nl.uu.cs.treewidth.graph.
Graph
Deprecated.
Adds an edge between a and b in the graph.
addEdge(NeighborHashSetVertex<Data>, NeighborHashSetVertex<Data>)
- Method in class nl.uu.cs.treewidth.graph.
NeighborHashSetGraph
Deprecated.
Adds an edge between a and b in the graph.
addEdge(NVertex<D>, NVertex<D>)
- Method in class nl.uu.cs.treewidth.ngraph.
NGraph
addNeighbor(NVertex<D>)
- Method in class nl.uu.cs.treewidth.ngraph.
HashVertex
addNeighbor(NVertex<D>)
- Method in class nl.uu.cs.treewidth.ngraph.
ListVertex
addNeighbor(NVertex<D>)
- Method in class nl.uu.cs.treewidth.ngraph.
NVertex
addVertex(Vertex<Data>)
- Method in class nl.uu.cs.treewidth.graph.
Graph
Deprecated.
Adds a vertex to the graph.
addVertex(NeighborHashSetVertex<Data>)
- Method in class nl.uu.cs.treewidth.graph.
NeighborHashSetGraph
Deprecated.
Adds a vertex to the graph.
addVertex(NVertex<D>)
- Method in class nl.uu.cs.treewidth.ngraph.
ListGraph
addVertex(NVertex<D>)
- Method in class nl.uu.cs.treewidth.ngraph.
NGraph
Algorithm
<
D
extends
GraphInput.InputData
> - Interface in
nl.uu.cs.treewidth.algorithm
Base interface for all algorithms.
AlgoTester
- Class in
nl.uu.cs.treewidth
AllStartLexBFS
<
D
extends
GraphInput.InputData
> - Class in
nl.uu.cs.treewidth.algorithm
Triangulation by using the elimination scheme found by applying the LEX-P algorithm.
AllStartLexBFS()
- Constructor for class nl.uu.cs.treewidth.algorithm.
AllStartLexBFS
AllStartMaximumCardinalitySearch
<
D
extends
GraphInput.InputData
> - Class in
nl.uu.cs.treewidth.algorithm
Triangulation by using the elimination scheme obtained by using the MCS (Maximum Cardinality Search) algorithm as given by Tarjan and Yannakakis.
AllStartMaximumCardinalitySearch()
- Constructor for class nl.uu.cs.treewidth.algorithm.
AllStartMaximumCardinalitySearch
AllStartMaximumCardinalitySearchMinimal
<
D
extends
GraphInput.InputData
> - Class in
nl.uu.cs.treewidth.algorithm
Triangulation obtained by using the elimination scheme produced by the MCS (Maximum Cardinality Search) algorithm of Berry et al.
AllStartMaximumCardinalitySearchMinimal()
- Constructor for class nl.uu.cs.treewidth.algorithm.
AllStartMaximumCardinalitySearchMinimal
AllStartMaximumMinimumDegree
<
D
extends
GraphInput.InputData
> - Class in
nl.uu.cs.treewidth.algorithm
The degeneracity of a graph is a lower bound for treewidth.
AllStartMaximumMinimumDegree()
- Constructor for class nl.uu.cs.treewidth.algorithm.
AllStartMaximumMinimumDegree
Starts out as a lowerbound of -infty; improved to the mindegree lowerbound once run() is called.
AllStartMaximumMinimumDegreePlusLeastC
<
D
extends
GraphInput.InputData
> - Class in
nl.uu.cs.treewidth.algorithm
The MMD+ heuristic with the least-c contraction rul: when there is a tiebreaker, we contract such that the contracted vertices have the smallest number of common neighbors.
AllStartMaximumMinimumDegreePlusLeastC()
- Constructor for class nl.uu.cs.treewidth.algorithm.
AllStartMaximumMinimumDegreePlusLeastC
Starts out as a lowerbound of -infty; improved to the mindegree lowerbound once run() is called.
AllStartMinorMinWidth
<
D
extends
GraphInput.InputData
> - Class in
nl.uu.cs.treewidth.algorithm
The algorithm repeativly contracts the lowest degree vertex with a lowest degree neighbor.
AllStartMinorMinWidth()
- Constructor for class nl.uu.cs.treewidth.algorithm.
AllStartMinorMinWidth
Starts out as a lowerbound of -infty; improved to the mindegree lowerbound once run() is called.
AllStartMinorMinWidth_QuickBB
<
D
extends
GraphInput.InputData
> - Class in
nl.uu.cs.treewidth.algorithm
The algorithm repeativly contracts the lowest degree vertex with a lowest degree neighbor.
AllStartMinorMinWidth_QuickBB()
- Constructor for class nl.uu.cs.treewidth.algorithm.
AllStartMinorMinWidth_QuickBB
Starts out as a lowerbound of -infty; improved to the mindegree lowerbound once run() is called.
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