dev.roanh.cpqkeys.algo

Class Bliss

java.lang.Object

dev.roanh.cpqkeys.algo.Bliss

public class Bliss
extends java.lang.Object

Binding for Bliss.

See Also:

Bliss website

Field Summary

Fields

Modifier and Type	Field and Description
static Algorithm	INSTANCE Algorithm binding for bliss.

Constructor Summary

Constructors

Constructor and Description
Bliss()

Method Summary

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 Bliss on the given input graph.
private static long[]	computeCanon(int[] edges, int[] colors) Computes the canonical labelling of the given coloured graph.

Methods inherited from class java.lang.Object

clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Field Detail

INSTANCE

public static final Algorithm INSTANCE

Algorithm binding for bliss.

Constructor Detail

Bliss

public Bliss()

Method Detail

computeCanon

private static long[] computeCanon(dev.roanh.gmark.util.Graph<dev.roanh.gmark.conjunct.cpq.QueryGraphCPQ.Vertex,dev.roanh.gmark.core.graph.Predicate> input)

Runs Bliss on the given input graph. The input graph first has its edge labels converted to nodes, and is then converted to a coloured graph.

Parameters:

input - The input graph.

Returns:

An array of time measurements containing in the first index the graph transform time, in the second index the native setup time (graph construction) and in the third index the canonization time. All times are in nanoseconds.

computeCanon

private static long[] computeCanon(int[] edges,
                                   int[] colors)

Computes the canonical labelling of the given coloured graph. Returns the time in milliseconds required for computations.

Parameters:

edges - The input graph as a list of edges with two consecutive indices representing the ID of the source and target vertex of an edge respectively.

colors - An array with as length the number of vertices in the graph and at each index for the vertex with the same ID as the index its color (as an integer).

Returns:

An array with two elements, first the time in nanoseconds it took to construct the graph and second the time in nanoseconds it took to compute the canonical form of the graph.