LAD is a program (in C) for solving the subgraph isomorphism problem, the
goal of which is to decide if there exists a copy of a pattern graph in a
target graph. It can be used to solve induced or partial subgraph isomorphism
problems. The user may specify additional compatibility relationships among
the nodes. LAD is distributed under the CeCILL-B FREE SOFTWARE LICENSE.
Nested Class Summary
Nested classes/interfaces inherited from class grph.algo.lad.LAD