|
||||||||||
PREV NEXT | FRAMES NO FRAMES |
Packages that use NVertex | |
---|---|
nl.uu.cs.treewidth.algorithm | |
nl.uu.cs.treewidth.ngraph |
Uses of NVertex in nl.uu.cs.treewidth.algorithm |
---|
Fields in nl.uu.cs.treewidth.algorithm declared as NVertex | |
---|---|
NVertex<D> |
GreedyDegree.GreedyData.original
|
NVertex<D> |
GreedyFillIn.GreedyData.original
|
Methods in nl.uu.cs.treewidth.algorithm that return types with arguments of type NVertex | |
---|---|
java.util.HashSet<NVertex<D>> |
CliqueFinder.maxClique(NGraph<D> g)
|
Methods in nl.uu.cs.treewidth.algorithm with parameters of type NVertex | |
---|---|
void |
AllStartMinorMinWidth_QuickBB.contractEdge(NVertex<nl.uu.cs.treewidth.algorithm.QuickBB.QuickBBData> v1,
NVertex<nl.uu.cs.treewidth.algorithm.QuickBB.QuickBBData> v2)
|
void |
AllStartMinorMinWidth_QuickBB.contractEdge(NVertex<nl.uu.cs.treewidth.algorithm.QuickBB.QuickBBData> v1,
NVertex<nl.uu.cs.treewidth.algorithm.QuickBB.QuickBBData> v2)
|
void |
MinorMinWidth_QuickBB.contractEdge(NVertex<nl.uu.cs.treewidth.algorithm.QuickBB.QuickBBData> v1,
NVertex<nl.uu.cs.treewidth.algorithm.QuickBB.QuickBBData> v2)
This method 'contracts' the edge between v1 and v2. |
void |
MinorMinWidth_QuickBB.contractEdge(NVertex<nl.uu.cs.treewidth.algorithm.QuickBB.QuickBBData> v1,
NVertex<nl.uu.cs.treewidth.algorithm.QuickBB.QuickBBData> v2)
This method 'contracts' the edge between v1 and v2. |
void |
AllStartMaximumCardinalitySearchMinimal.goRecursive(NVertex<nl.uu.cs.treewidth.algorithm.AllStartMaximumCardinalitySearchMinimal.MCSMData> v,
int w)
|
void |
MaximumCardinalitySearchMinimal.goRecursive(NVertex<nl.uu.cs.treewidth.algorithm.MaximumCardinalitySearchMinimal.MCSMData> v,
int w)
|
void |
AllStartMinorMinWidth_QuickBB.removeVertex(NVertex<nl.uu.cs.treewidth.algorithm.QuickBB.QuickBBData> v1)
|
void |
MinorMinWidth_QuickBB.removeVertex(NVertex<nl.uu.cs.treewidth.algorithm.QuickBB.QuickBBData> v1)
This method removes the vertex from the copies of the neigborlists of its neighbors and clears it's own neighborlist copy. |
void |
AllStartMaximumCardinalitySearch.updateNeighbours(NVertex<nl.uu.cs.treewidth.algorithm.AllStartMaximumCardinalitySearch.MCSData> v)
|
void |
AllStartMaximumCardinalitySearchMinimal.updateVerticesWithPathFrom(NVertex<nl.uu.cs.treewidth.algorithm.AllStartMaximumCardinalitySearchMinimal.MCSMData> z)
|
Constructors in nl.uu.cs.treewidth.algorithm with parameters of type NVertex | |
---|---|
GreedyDegree.GreedyData(NVertex<D> from)
|
|
GreedyFillIn.GreedyData(NVertex<D> from)
|
Uses of NVertex in nl.uu.cs.treewidth.ngraph |
---|
Subclasses of NVertex in nl.uu.cs.treewidth.ngraph | |
---|---|
class |
HashVertex<D>
|
class |
ListVertex<D>
|
Fields in nl.uu.cs.treewidth.ngraph declared as NVertex | |
---|---|
NVertex<D> |
NEdge.a
|
NVertex<D> |
NEdge.b
|
Fields in nl.uu.cs.treewidth.ngraph with type parameters of type NVertex | |
---|---|
java.util.ArrayList<NVertex<D>> |
ListVertex.neighbors
|
java.util.ArrayList<NVertex<D>> |
NVertexOrder.order
|
java.util.ArrayList<NVertex<D>> |
ListGraph.vertices
The vertex list for this graph is stored in an ArrayList TODO This would be nicer as a protected field, but right now it is convenient to have it public. |
java.util.Set<NVertex<D>> |
NTDBag.vertices
|
Methods in nl.uu.cs.treewidth.ngraph that return NVertex | ||
---|---|---|
abstract NVertex<D> |
NVertex.copy()
|
|
NVertex<D> |
NGraph.getSimplicialVertex()
|
|
NVertex<D> |
ListGraph.getVertex(int i)
|
|
abstract NVertex<D> |
NGraph.getVertex(int i)
|
|
abstract
|
NVertex.newOfSameType(T d)
|
Methods in nl.uu.cs.treewidth.ngraph that return types with arguments of type NVertex | |
---|---|
abstract java.util.Iterator<NVertex<D>> |
NVertex.getNeighbors()
|
java.util.Iterator<NVertex<D>> |
ListVertex.getNeighbors()
|
java.util.Iterator<NVertex<D>> |
HashVertex.getNeighbors()
|
java.util.Iterator<NVertex<D>> |
ListGraph.getVertices()
|
abstract java.util.Iterator<NVertex<D>> |
NGraph.getVertices()
|
java.util.Iterator<NVertex<D>> |
NVertex.iterator()
|
java.util.Iterator<NVertex<D>> |
NGraph.iterator()
|
Methods in nl.uu.cs.treewidth.ngraph with parameters of type NVertex | |
---|---|
void |
NGraph.addEdge(NVertex<D> a,
NVertex<D> b)
|
void |
NGraph.addEdge(NVertex<D> a,
NVertex<D> b)
|
abstract void |
NVertex.addNeighbor(NVertex<D> v)
|
void |
ListVertex.addNeighbor(NVertex<D> v)
|
void |
HashVertex.addNeighbor(NVertex<D> v)
|
void |
ListGraph.addVertex(NVertex<D> v)
|
abstract void |
NGraph.addVertex(NVertex<D> v)
|
void |
NGraph.contractEdge(NVertex<D> a,
NVertex<D> b)
|
void |
NGraph.contractEdge(NVertex<D> a,
NVertex<D> b)
|
To |
NGraph.Convertor.convert(NVertex<From> v)
|
void |
NGraph.deEliminate(NVertex<D> v,
java.util.ArrayList<NEdge<D>> es)
|
void |
NGraph.eliminate(NVertex<D> v)
|
java.util.ArrayList<NEdge<D>> |
NGraph.eliminate2(NVertex<D> v)
|
void |
NGraph.ensureEdge(NVertex<D> a,
NVertex<D> b)
|
void |
NGraph.ensureEdge(NVertex<D> a,
NVertex<D> b)
|
abstract boolean |
NVertex.ensureNeighbor(NVertex<D> v)
|
boolean |
ListVertex.ensureNeighbor(NVertex<D> v)
|
boolean |
HashVertex.ensureNeighbor(NVertex<D> v)
|
abstract boolean |
NVertex.isNeighbor(NVertex<D> v)
|
boolean |
ListVertex.isNeighbor(NVertex<D> v)
|
boolean |
HashVertex.isNeighbor(NVertex<D> v)
|
abstract void |
NVertex.removeNeighbor(NVertex<D> v)
|
void |
ListVertex.removeNeighbor(NVertex<D> v)
|
void |
HashVertex.removeNeighbor(NVertex<D> v)
|
void |
ListGraph.removeVertex(NVertex<D> v)
|
abstract void |
NGraph.removeVertex(NVertex<D> v)
|
boolean |
NGraph.testAlmostSimplicial(NVertex<D> v)
|
boolean |
NGraph.testSimplicial(NVertex<D> v)
|
Method parameters in nl.uu.cs.treewidth.ngraph with type arguments of type NVertex | |
---|---|
void |
ListGraph.setVertices(java.util.ArrayList<NVertex<D>> vs)
|
abstract void |
NGraph.setVertices(java.util.ArrayList<NVertex<D>> vs)
|
Constructors in nl.uu.cs.treewidth.ngraph with parameters of type NVertex | |
---|---|
NEdge(NVertex<D> a,
NVertex<D> b)
|
|
NEdge(NVertex<D> a,
NVertex<D> b)
|
|
||||||||||
PREV NEXT | FRAMES NO FRAMES |