If the Wheel Doesn't Work, Reinvent it
Richard L. Apodaca · 2009
Chris Steinbeck has an interesting post on the CDK code review process that discusses a new VF implementation. In it, he notes: For the unfamiliar, VF is a subgraph matching algorithm that has been shown to perform better than Ullmann for small graphs, and much better than Ullmann for large graphs. Faced with essentially the same problem of implementing VF in Java for MX, I abandoned my early efforts to port the VFlib C++ implementation.