public class Nishe
extends java.lang.Object
Modifier and Type | Field and Description |
---|---|
static Algorithm |
INSTANCE
Algorithm binding for Nishe.
|
Constructor and Description |
---|
Nishe() |
Modifier and Type | Method and Description |
---|---|
private static long[] |
computeCanon(dev.roanh.gmark.util.Graph<dev.roanh.gmark.conjunct.cpq.QueryGraphCPQ.Vertex,dev.roanh.gmark.core.graph.Predicate> input)
Runs Nishe on the given input graph.
|
private static long[] |
computeCanon(int[][] adj,
int[] colors)
Computes the canonical trace value and new partition nest for the
given graph with the given vertex colouring.
|
public static final Algorithm INSTANCE
private static long[] computeCanon(dev.roanh.gmark.util.Graph<dev.roanh.gmark.conjunct.cpq.QueryGraphCPQ.Vertex,dev.roanh.gmark.core.graph.Predicate> input)
input
- The input graph.private static long[] computeCanon(int[][] adj, int[] colors)
adj
- The input graph in adjacency list format, n
arrays with each the indices of the neighbours of the
n
-th vertex.colors
- An array defining the color of each vertex, the array
is expected to contain the indices of the vertices with the
same color in the following format. The index used to refer
to a vertex is always one higher than the actual index in the
adjacency list. A negative index indicates the start of a new
color group with all following vertices being of the same color.
Vertices within each color group are expected to be in sorted
ascending order.