Package net.xqhs.graphs.matcher

This package contains the definition of the net.xqhs.graphs.matcher.GraphMatcher interface and the GraphMatcherQuick implementation.

See:
Description

Interface Summary

GraphMatchingProcess

An implementation of this interface abstracts the matching process between a graph and a pattern (or two graph).

Class Summary

GraphMatcherQuick	An algorithm that finds partial matches between a graph pattern GP (or G^P) and a graph (G).
GraphMatcherQuick.EdgeComparator	Graph/pattern edge comparator based on label and then hash code.
GraphMatcherQuick.MatchSingleComparator	Match comparator with additional features for single-edge matches.
Match	Class describing a [partial] match of GP in G.
Match.MatchComparator	Match comparator.
MatchingVisualizer	Visualizer for the matching process.
MonitorPack	The class works in conjunction with graph matching classes (such as GraphMatcherQuick) to handle both performance evaluation and visualizing tasks.

Enum Summary

Match.Candidacy

Possible values for the situations in which two matches can be with regard to merging.

Package net.xqhs.graphs.matcher Description

This package contains the definition of the net.xqhs.graphs.matcher.GraphMatcher interface and the GraphMatcherQuick implementation.

Author:

Andrei Olaru