I am working with is the Ullmann algorithm for finding maximum subgraph isomorphism
I suspect that if you posted your implementation that its performance could be improved substantially. Especially if you are manipulating large 2D arrays of 0's & 1's much of the time.
In reply to Re^3: Performance problem with Clone Method
by BrowserUk
in thread Performance problem with Clone Method
by Commandosupremo
| For: | Use: | ||
| & | & | ||
| < | < | ||
| > | > | ||
| [ | [ | ||
| ] | ] |