de.rwth.i2.attestor.graph.morphism

Class VF2Algorithm

java.lang.Object

de.rwth.i2.attestor.graph.morphism.VF2Algorithm

public class VF2Algorithm
extends Object

This class implements the VF2 (sub)graph searching algorithm in order to find graph morphisms between two Graphs. More precisely, we are given a pattern Graph and target Graph and search for a morphism from the pattern into the target Graph.

Essentially VF2Algorithm implements a backtracking algorithm to search for possible graph morphisms. Each element of the search space is represented by a VF2State, which represents a partial morphism together with additional data that allow efficient backtracking. The search tree is constructed in a way such that no copies of the partial morphism are required. VF2Algorithm depends on a list of FeasibilityFunctions that determine possible pairs of pattern-target nodes that are matched onto each other. The FeasibilityFunctions thus determine the type of Morphism that is actually computed.

A detailed examination of the Algorithm is found in the following paper by

Author:

Christoph

See Also:

Cordella et al.

There are two main methodExecution in this class for clients:

{@link VF2Algorithm#builder()} creates a builder to create a customized VF2Algorithm that, for example, includes the desired FeasibilityFunctions.

{@link VF2Algorithm#match(Graph, Graph)} executes the algorithm for the provided pair of Graphs.

Field Summary

Fields

Modifier and Type	Field and Description
static boolean	DEBUG

Method Summary

Modifier and Type	Method and Description
static VF2AlgorithmBuilder	builder()
Morphism	getMorphism()
boolean	match(Graph pattern, Graph target) Executes the algorithm to find Morphisms from pattern into target.

Methods inherited from class java.lang.Object

clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Field Detail

DEBUG

public static final boolean DEBUG

See Also:

Constant Field Values

Method Detail

builder

public static VF2AlgorithmBuilder builder()

Returns:

A builder to create a customized VF2Algorithm.

match

public boolean match(Graph pattern,
                     Graph target)

Executes the algorithm to find Morphisms from pattern into target.

Parameters:

pattern - The Graph that should be searched for.

target - The Graph we search in.

Returns:

true if and only if at least one Morphism exists.

getMorphism

public Morphism getMorphism()

Returns:

The morphism that has been found. Null otherwise.