|
||||||||||
PREV NEXT | FRAMES NO FRAMES |
Packages that use NGraph | |
---|---|
nl.uu.cs.treewidth | |
nl.uu.cs.treewidth.algorithm | |
nl.uu.cs.treewidth.input | |
nl.uu.cs.treewidth.ngraph | |
nl.uu.cs.treewidth.output |
Uses of NGraph in nl.uu.cs.treewidth |
---|
Methods in nl.uu.cs.treewidth with parameters of type NGraph | |
---|---|
static void |
AlgoTester.test(java.lang.String typeName,
NGraph<GraphInput.InputData> g)
|
Uses of NGraph in nl.uu.cs.treewidth.algorithm |
---|
Methods in nl.uu.cs.treewidth.algorithm that return NGraph | |
---|---|
NGraph<NTDBag<D>> |
PermutationToTreeDecomposition.getDecomposition()
|
NGraph<NTDBag<D>> |
Constructive.getDecomposition()
Returns the found tree decomposition. |
NGraph<NTDBag<D>> |
PermutationGuesser.getDecomposition()
|
Methods in nl.uu.cs.treewidth.algorithm with parameters of type NGraph | |
---|---|
int |
AllStartMaximumMinimumDegreePlusLeastC.goRecursive(NGraph<D> graph,
int round)
|
java.util.HashSet<NVertex<D>> |
CliqueFinder.maxClique(NGraph<D> g)
|
void |
PermutationToTreeDecomposition.setInput(NGraph<D> g)
|
void |
AllStartMaximumCardinalitySearch.setInput(NGraph<D> g)
|
void |
Algorithm.setInput(NGraph<D> g)
Sets the input the algorithm will run on. |
void |
AllStartMaximumMinimumDegree.setInput(NGraph<D> g)
|
void |
GreedyDegree.setInput(NGraph<D> g)
|
void |
MaximumMinimumDegreePlusLeastC.setInput(NGraph<D> g)
|
void |
AllStartMaximumCardinalitySearchMinimal.setInput(NGraph<D> g)
|
void |
MaximumMinimumDegreePlusMaxD.setInput(NGraph<D> g)
|
void |
MaximumMinimumDegreePlusMinD.setInput(NGraph<D> g)
|
void |
AllStartMinorMinWidth.setInput(NGraph<D> g)
|
void |
PermutationGuesser.setInput(NGraph<D> g)
|
void |
MaximumCardinalitySearchMinimal.setInput(NGraph<D> g)
|
void |
MinDegree.setInput(NGraph<D> g)
|
void |
AllStartMaximumMinimumDegreePlusLeastC.setInput(NGraph<D> g)
|
void |
MinorMinWidth.setInput(NGraph<D> g)
|
void |
MaximumMinimumDegree.setInput(NGraph<D> g)
|
void |
AllStartLexBFS.setInput(NGraph<D> g)
|
void |
MaximumCardinalitySearch.setInput(NGraph<D> g)
|
void |
LexBFS.setInput(NGraph<D> g)
|
void |
QuickBB.setInput(NGraph<D> g)
|
void |
Ramachandramurthi.setInput(NGraph<D> g)
|
void |
PreProcessor.setInput(NGraph<D> g)
|
void |
GreedyFillIn.setInput(NGraph<D> g)
|
void |
TreewidthDP.setInput(NGraph<D> g)
|
void |
MaximumMinimumDegreePlusMinD2.setInput(NGraph<nl.uu.cs.treewidth.algorithm.QuickBB.QuickBBData> g)
|
void |
AllStartMinorMinWidth_QuickBB.setInput(NGraph<nl.uu.cs.treewidth.algorithm.QuickBB.QuickBBData> g)
|
void |
MinorMinWidth_QuickBB.setInput(NGraph<nl.uu.cs.treewidth.algorithm.QuickBB.QuickBBData> g)
This method sets the input. |
Uses of NGraph in nl.uu.cs.treewidth.input |
---|
Methods in nl.uu.cs.treewidth.input that return NGraph | |
---|---|
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 NGraph in nl.uu.cs.treewidth.ngraph |
---|
Subclasses of NGraph in nl.uu.cs.treewidth.ngraph | |
---|---|
class |
ListGraph<D>
|
Methods in nl.uu.cs.treewidth.ngraph that return NGraph | ||
---|---|---|
NGraph<D> |
ListGraph.copy()
|
|
NGraph<D> |
NGraph.copy()
|
|
|
NGraph.copy(NGraph.Convertor<D,To> c)
|
|
static
|
Utility.newify(Graph<D> g)
|
Uses of NGraph in nl.uu.cs.treewidth.output |
---|
Methods in nl.uu.cs.treewidth.output with parameters of type NGraph | ||
---|---|---|
static
|
DotWriter.format(NGraph<D> g)
|
|
static
|
DotWriter.formatTD(NGraph<NTDBag<D>> g)
|
|
static
|
Output.present(NGraph<Data> g,
java.lang.String title)
|
|
static void |
Output.presentTD(NGraph<NTDBag<GraphInput.InputData>> g,
java.lang.String title)
|
|
||||||||||
PREV NEXT | FRAMES NO FRAMES |