Package de.ipk_gatersleben.ag_nw.graffiti.plugins.algorithms.naive_pattern_finder

Class UllmannSubraphIsomAdjMatrixState

java.lang.Object

de.ipk_gatersleben.ag_nw.graffiti.plugins.algorithms.naive_pattern_finder.UllmannSubraphIsomAdjMatrixState

All Implemented Interfaces:

Cloneable

public class UllmannSubraphIsomAdjMatrixState
extends Object

Author:

matthiak

Field Summary

Fields

Modifier and Type	Field	Description
static int	NULL_NODE	The integer value for "not a node at all".

Constructor Summary

Constructors

Constructor	Description
UllmannSubraphIsomAdjMatrixState(Graph patternGraph, Graph targetGraph, boolean ignoreEdgeDirection)

Method Summary

Modifier and Type	Method	Description
void	addPair(int nodeOfPatternGraph, int nodeOfTargetGraph)
void	backtrack()
Object	clone()
boolean	computeNextPair(int prevPatternNodeID, int prevTargetNodeID)
byte[][]	getAdjMatrixGraph()
byte[][]	getAdjMatrixPattern()
boolean[][]	getCompatibilityMatrix()
int	getCoreLength()
Node[]	getMatchingNodesOfPattern()
Node[]	getMatchingNodesOfTarget()
int[]	getMatchNodesInGraphForPattern()
int[]	getMatchNodesInPatternForGraph()
int	getNextNodeOfPattern()
int	getNextNodeOfTarget()
Graph	getPatternGraph()
Graph	getTargetGraph()
boolean	isDead()
boolean	isFeasiblePair(int node1, int node2)
boolean	isGoal()
static void	printAdjacencyMatrix(Node[] nodes, byte[][] createAdjacencyMatrix)
void	printCompatibilityMatrix()

Methods inherited from class java.lang.Object

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

Field Details

NULL_NODE

static final int NULL_NODE

The integer value for "not a node at all".

See Also:

Constant Field Values

Constructor Details

UllmannSubraphIsomAdjMatrixState

public UllmannSubraphIsomAdjMatrixState(Graph patternGraph,
Graph targetGraph,
boolean ignoreEdgeDirection)

Method Details

getAdjMatrixPattern

public byte[][] getAdjMatrixPattern()

getAdjMatrixGraph

public byte[][] getAdjMatrixGraph()

getCompatibilityMatrix

public boolean[][] getCompatibilityMatrix()

getMatchNodesInGraphForPattern

public int[] getMatchNodesInGraphForPattern()

Returns:

the matchNodesInGraphForPattern

getMatchNodesInPatternForGraph

public int[] getMatchNodesInPatternForGraph()

Returns:

the matchNodesInPatternForGraph

computeNextPair

public boolean computeNextPair(int prevPatternNodeID,
int prevTargetNodeID)

isFeasiblePair

public boolean isFeasiblePair(int node1,
int node2)

addPair

public void addPair(int nodeOfPatternGraph,
int nodeOfTargetGraph)

getNextNodeOfPattern

public int getNextNodeOfPattern()

getNextNodeOfTarget

public int getNextNodeOfTarget()

isGoal

public boolean isGoal()

isDead

public boolean isDead()

backtrack

public void backtrack()

getPatternGraph

public Graph getPatternGraph()

getTargetGraph

public Graph getTargetGraph()

getCoreLength

public int getCoreLength()

getMatchingNodesOfPattern

public Node[] getMatchingNodesOfPattern()

getMatchingNodesOfTarget

public Node[] getMatchingNodesOfTarget()

clone

public Object clone()

printCompatibilityMatrix

public void printCompatibilityMatrix()

printAdjacencyMatrix

public static void printAdjacencyMatrix(Node[] nodes,
byte[][] createAdjacencyMatrix)