|
||||||||||
PREV NEXT | FRAMES NO FRAMES |
Packages that use NVertexOrder | |
---|---|
nl.uu.cs.treewidth.algorithm | |
nl.uu.cs.treewidth.ngraph |
Uses of NVertexOrder in nl.uu.cs.treewidth.algorithm |
---|
Methods in nl.uu.cs.treewidth.algorithm that return NVertexOrder | |
---|---|
NVertexOrder<D> |
AllStartMaximumCardinalitySearch.getPermutation()
|
NVertexOrder<D> |
GreedyDegree.getPermutation()
|
NVertexOrder<D> |
AllStartMaximumCardinalitySearchMinimal.getPermutation()
|
NVertexOrder<D> |
MaximumCardinalitySearchMinimal.getPermutation()
|
NVertexOrder<D> |
AllStartLexBFS.getPermutation()
|
NVertexOrder<D> |
MaximumCardinalitySearch.getPermutation()
|
NVertexOrder<D> |
LexBFS.getPermutation()
|
NVertexOrder<D> |
Permutation.getPermutation()
|
NVertexOrder<D> |
QuickBB.getPermutation()
|
NVertexOrder<D> |
GreedyFillIn.getPermutation()
|
Constructors in nl.uu.cs.treewidth.algorithm with parameters of type NVertexOrder | |
---|---|
PermutationToTreeDecomposition(NVertexOrder<D> givenPermutation)
Create an instance of the PermutationToTreeDecomposition algorithm and use a given permutation. |
Uses of NVertexOrder in nl.uu.cs.treewidth.ngraph |
---|
Constructors in nl.uu.cs.treewidth.ngraph with parameters of type NVertexOrder | |
---|---|
NVertexOrder(NVertexOrder<D> other)
|
|
||||||||||
PREV NEXT | FRAMES NO FRAMES |