de.rwth.i2.attestor.graph.morphism

Interface FeasibilityFunction

All Known Implementing Classes:

AbstractCompatibleNeighbours, CompatibleEdgeLabels, CompatibleExternalNodes, CompatibleNodeTypes, CompatiblePredecessors, CompatibleSuccessors, EmbeddingEdgeLabels, EmbeddingExternalNodes, IdenticalNodeTypes, MinAbstractionDistance, OneStepLookaheadIn, OneStepLookaheadOut, TwoStepLookahead, WeaklyCompatibleExternalNodes

public interface FeasibilityFunction

A FeasibilityFunction is a condition that is evaluated by a VF2Algorithm in order to determine whether extending a VF2State by a pair of candidate nodes might still correspond to a valid graph morphism.

Author:

Christoph

Method Summary

Modifier and Type	Method and Description
boolean	eval(VF2State state, int p, int t) Evaluates whether extending the given state by a candidate pair results in a partial mapping between pattern and target Graph might still lead to a valid Morphism.

Method Detail

eval

boolean eval(VF2State state,
             int p,
             int t)

Evaluates whether extending the given state by a candidate pair results in a partial mapping between pattern and target Graph might still lead to a valid Morphism.

Parameters:

state - The current VF2State determining the partial Morphism computed so far.

p - The new pattern candidate node that should be added to the morphism.

t - The new target candidate node that should be added to the morphism.

Returns:

True if and only if adding the candidate pair to the current state of the morphism might still lead to a valid Morphism.