Uses of Package
de.rwth.i2.attestor.graph.morphism

Packages that use de.rwth.i2.attestor.graph.morphism

Package	Description
de.rwth.i2.attestor.graph.heap.internal	All the messy details to implement a HeapConfiguration as a bipartite directed labeled graph.
de.rwth.i2.attestor.graph.morphism	This package implements algorithms to compute various kinds of graph morphisms.
de.rwth.i2.attestor.graph.morphism.checkers	Specialized wrappers to compute frequently used morphisms such as isomorphisms and embeddings.
de.rwth.i2.attestor.graph.morphism.feasibility	All feasibility functions employed by the Morphism search to detect certain graph Morphisms.
de.rwth.i2.attestor.graph.morphism.terminationFunctions	Functions determining whether a suitable Morphism has been found or is impossible to find starting in the current state.
de.rwth.i2.attestor.phases.counterexamples.counterexampleGeneration.heapConfigurationPair

Classes in de.rwth.i2.attestor.graph.morphism used by de.rwth.i2.attestor.graph.heap.internal

Class and Description
Graph A model of directed graphs with node and edge labels that is used by MorphismChecker.
Morphism Implementation of a morphism between two Graphs.

Classes in de.rwth.i2.attestor.graph.morphism used by de.rwth.i2.attestor.graph.morphism

Class and Description
AbstractVF2GraphData Collects all data required by VF2Algorithm during the search for a suitable matching for a single graph.
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.
Graph A model of directed graphs with node and edge labels that is used by MorphismChecker.
Morphism Implementation of a morphism between two Graphs.
TerminationFunction A TerminationFunction determines whether the search for a graph Morphism has to be stopped.
VF2Algorithm This class implements the VF2 (sub)graph searching algorithm in order to find graph morphisms between two Graphs.
VF2AlgorithmBuilder A builder class to conveniently construct VF2Algorithms step by step.
VF2GraphData
VF2State Captures a current, possibly incomplete, candidate for a graph morphism that is constructed step by step by a VF2Algorithm.

Classes in de.rwth.i2.attestor.graph.morphism used by de.rwth.i2.attestor.graph.morphism.checkers

Class and Description
Graph A model of directed graphs with node and edge labels that is used by MorphismChecker.
Morphism Implementation of a morphism between two Graphs.
MorphismChecker A MorphismChecker takes two graphs, called pattern and target, and computes all graph morphisms from the pattern graph into the target graph.

Classes in de.rwth.i2.attestor.graph.morphism used by de.rwth.i2.attestor.graph.morphism.feasibility

Class and Description
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.
Graph A model of directed graphs with node and edge labels that is used by MorphismChecker.
VF2State Captures a current, possibly incomplete, candidate for a graph morphism that is constructed step by step by a VF2Algorithm.

Classes in de.rwth.i2.attestor.graph.morphism used by de.rwth.i2.attestor.graph.morphism.terminationFunctions

Class and Description
TerminationFunction A TerminationFunction determines whether the search for a graph Morphism has to be stopped.
VF2State Captures a current, possibly incomplete, candidate for a graph morphism that is constructed step by step by a VF2Algorithm.

Classes in de.rwth.i2.attestor.graph.morphism used by de.rwth.i2.attestor.phases.counterexamples.counterexampleGeneration.heapConfigurationPair

Class and Description
Graph A model of directed graphs with node and edge labels that is used by MorphismChecker.