| java.lang.Object
 com.hp.hpl.jena.regression.DiHyperCube
| DiHyperCube | | class DiHyperCube extends java.lang.Object (Code) | | A theoretical graph for testing purposes.
All nodes are anonymous resources. All edges are labelled
rdf:value.
The basic DiHyperCube consists of the nodes being the
corners of a hypercube (e.g. in 3D a cube)
with the statements being the edges of the cube, directed
from one corner labelled 2^n-1 to the opposite corner
labelled 0. The labels are not present in the model.
This basic graph is then extended, for test purposes
by duplicating a node.
author:
jjc
version:
Release='$Name: $' Revision='$Revision: 1.7 $' Date='$Date: 2008/01/02 12:07:04 $' |
| DiHyperCube | | public DiHyperCube(int dimension, Model m)(Code) | | Creates new DiHyperCube
|
| bitCount | | static int bitCount(int i)(Code) | | |
| equal | | static boolean equal(int a1, int b1)(Code) | | |
| equal | | static boolean equal(int a1, int a2, int b1, int b2)(Code) | | |
|
|