| 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.
|
| 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.
|
| Modifier and Type | Method and Description |
|---|---|
VF2State |
VF2State.shallowCopy() |
| Modifier and Type | Method and Description |
|---|---|
boolean |
TerminationFunction.eval(VF2State state)
Checks whether searching for a morphism can be stopped.
|
boolean |
FeasibilityFunction.eval(VF2State state,
int p,
int t)
Evaluates whether extending the given state by a candidate pair results in a partial mapping between
pattern and target Graph might still lead to a valid Morphism.
|
| Modifier and Type | Method and Description |
|---|---|
boolean |
CompatibleNodeTypes.eval(VF2State state,
int p,
int t) |
boolean |
AbstractCompatibleNeighbours.eval(VF2State state,
int p,
int t) |
boolean |
EmbeddingEdgeLabels.eval(VF2State state,
int p,
int t) |
boolean |
IdenticalNodeTypes.eval(VF2State state,
int p,
int t) |
boolean |
AdmissibleAbstraction.eval(VF2State state,
int p,
int t) |
boolean |
CompatibleExternalNodes.eval(VF2State state,
int p,
int t) |
boolean |
WeaklyCompatibleExternalNodes.eval(VF2State state,
int p,
int t) |
boolean |
EmbeddingExternalNodes.eval(VF2State state,
int p,
int t) |
boolean |
OneStepLookaheadOut.eval(VF2State state,
int p,
int t) |
boolean |
CompatibleEdgeLabels.eval(VF2State state,
int p,
int t) |
boolean |
TwoStepLookahead.eval(VF2State state,
int p,
int t) |
boolean |
OneStepLookaheadIn.eval(VF2State state,
int p,
int t) |
| Modifier and Type | Method and Description |
|---|---|
boolean |
MorphismFound.eval(VF2State state) |
boolean |
IsomorphismFound.eval(VF2State state) |
Copyright © 2019. All rights reserved.