An implementation of an improved Ullman's algorithm for the subgraph isomorphism problem.
The implementation uses the Boost Graph Library
Examples of use are located in the examples
folder.
You can build them by running make
in the root directory.
The compare
example is intended to compare this algorithm with the one present in the Boost Graph Library (VF2).
The inputs to the compare
executable are intended to be graphs from the VFLib graph database.