Files
-----

Makefile: make an executable (main) and test on 2 subgraph isomorphism instances 
main.c allDiff.c graph.c lad.c domains.c clique.c heuristic.c nogoods.c random.c sparseSet.c: source files
pattern.txt: example of non labelled pattern graph
target.txt: example of target graph
README: this file

Usage
-----

  -p FILE  Input pattern graph (mandatory)
  -t FILE  Input target graph (mandatory)
  -s INT   Set real time limit in seconds (default: 100)
  -a       Search for all solutions (default: stop at first solution)
  -f INT   Level of filtering: 0=LAD; 1=FC; 2=adaptive (default: 2)
  -c INT   Level of clique filtering: 0=no filtering; i=filtering wrt cliques of order i+2 (default: 4)
  -l INT   Limit on the number of failures before restarting (default: 10)
  -r FLOAT Ratio used to increase the limit after each restart (default: 1.1)
  -v       Print solutions (default: only number of solutions)
  -vv      Be verbose

Graph format
------------

Pattern and target graphs should be defined in two text files. The format of these files is defined as follows:
- The first line only contains the number n of vertices.
- Each following line gives, for each vertex i, the number of successors of i followed by the list of successors of i.
- Nodes must be numbered from 0 and, if there is an edge from i to j and an edge from j to i, then j must be a successor of i and i must be a successor of j.


