Uses of Interface
de.rwth.i2.attestor.graph.morphism.FeasibilityFunction

Packages that use FeasibilityFunction

Package	Description
de.rwth.i2.attestor.graph.morphism	This package implements algorithms to compute various kinds of graph morphisms.
de.rwth.i2.attestor.graph.morphism.feasibility	All feasibility functions employed by the Morphism search to detect certain graph Morphisms.

Uses of FeasibilityFunction in de.rwth.i2.attestor.graph.morphism

Methods in de.rwth.i2.attestor.graph.morphism with parameters of type FeasibilityFunction

Modifier and Type	Method and Description
VF2AlgorithmBuilder	VF2AlgorithmBuilder.addFeasibilityCondition(FeasibilityFunction condition) Adds a FeasibilityFunction used to prune the search space when searching for potential graph morphisms.

Uses of FeasibilityFunction in de.rwth.i2.attestor.graph.morphism.feasibility

Classes in de.rwth.i2.attestor.graph.morphism.feasibility that implement FeasibilityFunction

Modifier and Type	Class and Description
class	AbstractCompatibleNeighbours
class	AdmissibleAbstraction Restricts the considered morphisms to ones in which the distance from variables does not prevent admissibility.
class	CompatibleEdgeLabels Checks whether the edge labels of the successor and predecessor nodes of the given candidate pair are equal.
class	CompatibleExternalNodes Checks whether the nodes in the provided candidate pair either correspond to the same position in the respective sequence of external nodes or are both not external at all.
class	CompatibleNodeTypes Checks whether the labels of the nodes in the candidate pair coincide.
class	CompatiblePredecessors Checks whether all already matched predecessors of the pattern candidate node are matched to predecessors the the target candidate node.
class	CompatibleSuccessors Checks whether all already matched successors of the pattern candidate node are matched to predecessors the the target candidate node.
class	EmbeddingEdgeLabels Checks whether the edge labels from and to the pattern candidate node are covered by the corresponding edge labels from and to the target candidate node.
class	EmbeddingExternalNodes Checks whether the given candidate pair of nodes may correspond to an embedding from the pattern graph into the target graph if one of them is external.
class	IdenticalNodeTypes Checks whether the labels of the nodes in the candidate pair coincide.
class	OneStepLookaheadIn Determines the whether the current candidate pair cannot belong to a graph morphism due to a mismatch in the ingoing lookahead sets in the successors or predecessors of one of the candidate nodes.
class	OneStepLookaheadOut Determines the whether the current candidate pair cannot belong to a graph morphism due to a mismatch in the outgoing lookahead sets in the successors or predecessors of one of the candidate nodes.
class	TwoStepLookahead Determines the whether the current candidate pair cannot belong to a graph morphism due to a mismatch in the lookahead sets in the successors or predecessors of one of the candidate nodes.
class	WeaklyCompatibleExternalNodes Checks that pattern external iff target external