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

Packages that use Graph

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.phases.counterexamples.counterexampleGeneration.heapConfigurationPair

Uses of Graph in de.rwth.i2.attestor.graph.heap.internal

Classes in de.rwth.i2.attestor.graph.heap.internal that implement Graph

Modifier and Type	Class and Description
class	InternalHeapConfiguration An implementation of HeapConfiguration based on bipartite graphs, which are implemented in LabeledDigraph.

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

Methods in de.rwth.i2.attestor.graph.morphism that return Graph

Modifier and Type	Method and Description
Graph	AbstractVF2GraphData.getGraph()

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

Modifier and Type	Method and Description
boolean	VF2Algorithm.match(Graph pattern, Graph target) Executes the algorithm to find Morphisms from pattern into target.
void	MorphismChecker.run(Graph pattern, Graph target) Sets the pattern and target graph and searches for the first graph morphism.

Constructors in de.rwth.i2.attestor.graph.morphism with parameters of type Graph

Constructor and Description
AbstractVF2GraphData(Graph graph) Initializes an empty AbstractVF2GraphData object.
VF2GraphData(Graph graph)
VF2State(Graph patternGraph, Graph targetGraph) Computes a new initial state from two graphs

Uses of Graph in de.rwth.i2.attestor.graph.morphism.checkers

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

Modifier and Type	Method and Description
void	AbstractVF2MorphismChecker.run(Graph pattern, Graph target) Starts searching for graph morphisms of the pattern graph into the target graph.

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

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

Modifier and Type	Method and Description
protected abstract gnu.trove.list.array.TIntArrayList	AbstractCompatibleNeighbours.getAdjacent(Graph graph, int node)
protected gnu.trove.list.array.TIntArrayList	CompatiblePredecessors.getAdjacent(Graph graph, int node)
protected gnu.trove.list.array.TIntArrayList	CompatibleSuccessors.getAdjacent(Graph graph, int node)

Uses of Graph in de.rwth.i2.attestor.phases.counterexamples.counterexampleGeneration.heapConfigurationPair

Classes in de.rwth.i2.attestor.phases.counterexamples.counterexampleGeneration.heapConfigurationPair that implement Graph

Modifier and Type	Class and Description
class	HeapConfigurationPair A HeapConfigurationPair actually consists of two heap configurations that are materialized together.