|
||||||||||
PREV NEXT | FRAMES NO FRAMES |
Packages that use GraphInput.InputData | |
---|---|
nl.uu.cs.treewidth | |
nl.uu.cs.treewidth.algorithm | |
nl.uu.cs.treewidth.graph | |
nl.uu.cs.treewidth.input | |
nl.uu.cs.treewidth.output | |
nl.uu.cs.treewidth.testing |
Uses of GraphInput.InputData in nl.uu.cs.treewidth |
---|
Method parameters in nl.uu.cs.treewidth with type arguments of type GraphInput.InputData | |
---|---|
static void |
AlgoTester.test(java.lang.String typeName,
NGraph<GraphInput.InputData> g)
|
Uses of GraphInput.InputData in nl.uu.cs.treewidth.algorithm |
---|
Classes in nl.uu.cs.treewidth.algorithm with type parameters of type GraphInput.InputData | |
---|---|
interface |
Algorithm<D extends GraphInput.InputData>
Base interface for all algorithms. |
class |
AllStartLexBFS<D extends GraphInput.InputData>
Triangulation by using the elimination scheme found by applying the LEX-P algorithm. |
class |
AllStartMaximumCardinalitySearch<D extends GraphInput.InputData>
Triangulation by using the elimination scheme obtained by using the MCS (Maximum Cardinality Search) algorithm as given by Tarjan and Yannakakis. |
class |
AllStartMaximumCardinalitySearchMinimal<D extends GraphInput.InputData>
Triangulation obtained by using the elimination scheme produced by the MCS (Maximum Cardinality Search) algorithm of Berry et al. |
class |
AllStartMaximumMinimumDegree<D extends GraphInput.InputData>
The degeneracity of a graph is a lower bound for treewidth. |
class |
AllStartMaximumMinimumDegreePlusLeastC<D extends GraphInput.InputData>
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. |
class |
AllStartMinorMinWidth<D extends GraphInput.InputData>
The algorithm repeativly contracts the lowest degree vertex with a lowest degree neighbor. |
class |
AllStartMinorMinWidth_QuickBB<D extends GraphInput.InputData>
The algorithm repeativly contracts the lowest degree vertex with a lowest degree neighbor. |
class |
CliqueFinder<D extends GraphInput.InputData>
|
interface |
Constructive<D extends GraphInput.InputData>
Interface for algorithms that produce a tree decomposition. |
interface |
Exact<D extends GraphInput.InputData>
Interface for algorithms that calculate the exact treewidth. |
class |
GreedyDegree<D extends GraphInput.InputData>
The GreedyDegree algorithm computes a permutation and at the same time derives an upperbound. |
class |
GreedyFillIn<D extends GraphInput.InputData>
The GreedyFillIn algorithm computes a permutation and at the same time derives an upperbound. |
class |
LexBFS<D extends GraphInput.InputData>
Triangulation by using the elimination scheme found by applying the LEX-P algorithm. |
interface |
LowerBound<D extends GraphInput.InputData>
Interface for algorithms that compute a lowerbound. |
class |
MaximumCardinalitySearch<D extends GraphInput.InputData>
Triangulation by using the elimination scheme obtained by using the MCS (Maximum Cardinality Search) algorithm as given by Tarjan and Yannakakis. |
class |
MaximumCardinalitySearchMinimal<D extends GraphInput.InputData>
Triangulation obtained by using the elimination scheme produced by the MCS (Maximum Cardinality Search) algorithm of Berry et al. |
class |
MaximumMinimumDegree<D extends GraphInput.InputData>
The degeneracity of a graph is a lower bound for treewidth. |
class |
MaximumMinimumDegreePlusLeastC<D extends GraphInput.InputData>
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. |
class |
MaximumMinimumDegreePlusMaxD<D extends GraphInput.InputData>
The MMD+Max-d: Maximum Minimum Degree Plus max-d: gives the maximum over the minimum degrees of the vertices in the graph. |
class |
MaximumMinimumDegreePlusMinD<D extends GraphInput.InputData>
The MMD+Min-d: Maximum Minimum Degree Plus min-d: gives the maximum over the minimum degrees of the vertices in the graph. |
class |
MinDegree<D extends GraphInput.InputData>
The 'minimum degree' lower bound: gives the minimum degree of a vertex in the graph. |
class |
MinorMinWidth<D extends GraphInput.InputData>
Used graphstructure: NeighborHashSetGraph The 'MinorMinWidth' lower bound. |
class |
MinorMinWidth_QuickBB<D extends GraphInput.InputData>
The 'MinorMinWidth' lower bound. |
interface |
Permutation<D extends GraphInput.InputData>
|
class |
PermutationGuesser<D extends GraphInput.InputData>
|
class |
PermutationToTreeDecomposition<D extends GraphInput.InputData>
|
class |
PreProcessor<D extends GraphInput.InputData>
|
class |
QuickBB<D extends GraphInput.InputData>
A branch and bound algorithm for treewidth, designed by Gogate and Dechter. |
class |
Ramachandramurthi<D extends GraphInput.InputData>
The 'Ramachandramurthi' lower bound. |
class |
TreewidthDP<D extends GraphInput.InputData>
|
interface |
UpperBound<D extends GraphInput.InputData>
Interface for algorithms that compute an upperbound. |
Methods in nl.uu.cs.treewidth.algorithm that return types with arguments of type GraphInput.InputData | |
---|---|
LowerBound<GraphInput.InputData> |
LowerBound.Creator.create()
|
Uses of GraphInput.InputData in nl.uu.cs.treewidth.graph |
---|
Fields in nl.uu.cs.treewidth.graph with type parameters of type GraphInput.InputData | |
---|---|
java.util.ArrayList<Vertex<? extends GraphInput.InputData>> |
VertexOrder.vertices
Deprecated. |
Methods in nl.uu.cs.treewidth.graph that return types with arguments of type GraphInput.InputData | |
---|---|
Vertex<? extends GraphInput.InputData> |
VertexData.getOriginal()
Deprecated. |
Method parameters in nl.uu.cs.treewidth.graph with type arguments of type GraphInput.InputData | |
---|---|
VertexData |
VertexData.Convertor.convert(Vertex<? extends GraphInput.InputData> old)
|
void |
ElimFriendlyGraph.initVertex(Vertex<? extends GraphInput.InputData> v)
Deprecated. |
Constructor parameters in nl.uu.cs.treewidth.graph with type arguments of type GraphInput.InputData | |
---|---|
ElimFriendlyGraph(Graph<? extends GraphInput.InputData> g)
Deprecated. |
|
VertexData(Vertex<? extends GraphInput.InputData> original)
Deprecated. |
Uses of GraphInput.InputData in nl.uu.cs.treewidth.input |
---|
Methods in nl.uu.cs.treewidth.input that return types with arguments of type GraphInput.InputData | |
---|---|
NGraph<GraphInput.InputData> |
DgfReader.get()
|
NGraph<GraphInput.InputData> |
GridGraphGenerator.get()
|
NGraph<GraphInput.InputData> |
NKnightGraphGenerator.get()
|
NGraph<GraphInput.InputData> |
CliqueGraphGenerator.get()
|
NGraph<GraphInput.InputData> |
RandomGraphGenerator.get()
|
NGraph<GraphInput.InputData> |
NQueenGraphGenerator.get()
|
NGraph<GraphInput.InputData> |
StarGraphGenerator.get()
|
NGraph<GraphInput.InputData> |
GraphInput.get()
Return a graph. |
Uses of GraphInput.InputData in nl.uu.cs.treewidth.output |
---|
Method parameters in nl.uu.cs.treewidth.output with type arguments of type GraphInput.InputData | |
---|---|
static java.lang.String |
DotWriter.formatTD(Graph<TDBag<GraphInput.InputData>> g)
|
static void |
Output.presentTD(NGraph<NTDBag<GraphInput.InputData>> g,
java.lang.String title)
|
Uses of GraphInput.InputData in nl.uu.cs.treewidth.testing |
---|
Classes in nl.uu.cs.treewidth.testing with type parameters of type GraphInput.InputData | |
---|---|
static interface |
ResultChecker.AlgoCreator<D extends GraphInput.InputData>
|
|
||||||||||
PREV NEXT | FRAMES NO FRAMES |