grph.algo.lad

Class DirectedLAD

java.lang.Object

grph.algo.lad.LAD

grph.algo.lad.DirectedLAD

public class DirectedLAD
extends LAD

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

LAD.MODE

Constructor Summary

Constructors

Constructor and Description
DirectedLAD()

Method Summary

Modifier and Type	Method and Description
protected java.lang.String	getName()
static void	main(java.lang.String[] args)

Methods inherited from class grph.algo.lad.LAD

ensureCompiled, lad

Methods inherited from class java.lang.Object

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

Constructor Detail

DirectedLAD

public DirectedLAD()

Method Detail

getName

protected java.lang.String getName()

Specified by:

getName in class LAD

main

public static void main(java.lang.String[] args)