de.rwth.i2.attestor.graph.morphism

Interface Graph

All Known Implementing Classes:

HeapConfigurationPair, InternalHeapConfiguration

public interface Graph

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

Author:

Christoph

Method Summary

Modifier and Type	Method and Description
List<Object>	getEdgeLabel(int from, int to)
int	getExternalIndex(int node)
NodeLabel	getNodeLabel(int node)
gnu.trove.list.array.TIntArrayList	getPredecessorsOf(int node)
gnu.trove.list.array.TIntArrayList	getSuccessorsOf(int node)
boolean	hasEdge(int from, int to)
boolean	isEdgeBetweenMarkedNodes(int from, int to)
boolean	isExternal(int node)
int	size()

Method Detail

size

int size()

Returns:

The total number of nodes if this Graph.

hasEdge

boolean hasEdge(int from,
                int to)

Parameters:

from - The source node of the desired edges.

to - The target node of the desired edges.

Returns:

True if and only if there exists at least one edge with source from and target to.

getSuccessorsOf

gnu.trove.list.array.TIntArrayList getSuccessorsOf(int node)

Parameters:

node - The source node whose successor nodes are requested.

Returns:

A list of all successor nodes of the given source node.

getPredecessorsOf

gnu.trove.list.array.TIntArrayList getPredecessorsOf(int node)

Parameters:

node - The target node whose predecessor nodes are requested.

Returns:

A list of all predecessor nodes of the given target node.

getNodeLabel

NodeLabel getNodeLabel(int node)

Parameters:

node - The node whose label is requested.

Returns:

The label of the node or null if the node does not exist.

getEdgeLabel

List<Object> getEdgeLabel(int from,
                          int to)

Parameters:

from - The source node.

to - The target node.

Returns:

A repetition-free list of all edge labels of edges whose source node is from and whose target node is to.

isExternal

boolean isExternal(int node)

Parameters:

node - The node that should be checked.

Returns:

True if and only if the given node is external.

getExternalIndex

int getExternalIndex(int node)

Parameters:

node - An external node.

Returns:

The unique position of the node in the sequence of external nodes or -1 if the given node does not exist or is not external.

isEdgeBetweenMarkedNodes

boolean isEdgeBetweenMarkedNodes(int from,
                                 int to)