Packages

absurdist	The main graph matching algorithm.
bnb
common	Data representation classes used in both absurdist and penalty packages.
driver	The main classes for the several versions of the graph matching program (in a separate application with or without a GUI, or as an applet).
graph	Code for generating asymmetric graphs (graphs without non-trivial homomorphisms).
gui	Graphical user interface for displaying the graph matching process, and the best match found.
penalty	This package implements a graph matching method based on the minimization of a certain "penalty functional".
test	The main classes for the several test programs.