Package de.rwth.i2.attestor.graph.morphism.feasibility

All feasibility functions employed by the Morphism search to detect certain graph Morphisms.

See: Description

Class Summary

Class	Description
AbstractCompatibleNeighbours
CompatibleEdgeLabels	Checks whether the edge labels of the successor and predecessor nodes of the given candidate pair are equal.
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.
CompatibleNodeTypes	Checks whether the labels of the nodes in the candidate pair coincide.
CompatiblePredecessors	Checks whether all already matched predecessors of the pattern candidate node are matched to predecessors the the target candidate node.
CompatibleSuccessors	Checks whether all already matched successors of the pattern candidate node are matched to predecessors the the target candidate node.
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.
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.
IdenticalNodeTypes	Checks whether the labels of the nodes in the candidate pair coincide.
MinAbstractionDistance	Restricts the considered morphisms to ones in which the distance from variables to nodes with outgoing selector edges belonging to a morphism is at least the given minAbstractionDistance.
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.
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.
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.
WeaklyCompatibleExternalNodes	Checks that pattern external iff target external

Package de.rwth.i2.attestor.graph.morphism.feasibility Description

All feasibility functions employed by the Morphism search to detect certain graph Morphisms. The first approach to search for a different kind of Morphism or try a different heuristic should always be to change the feasibility functions employed by the Morphism search.

Author:

Christoph