diff options
Diffstat (limited to 'src/uk/ac/ox/cs/pagoda/endomorph/DependencyGraph.java')
| -rw-r--r-- | src/uk/ac/ox/cs/pagoda/endomorph/DependencyGraph.java | 7 |
1 files changed, 6 insertions, 1 deletions
diff --git a/src/uk/ac/ox/cs/pagoda/endomorph/DependencyGraph.java b/src/uk/ac/ox/cs/pagoda/endomorph/DependencyGraph.java index 8514808..320af09 100644 --- a/src/uk/ac/ox/cs/pagoda/endomorph/DependencyGraph.java +++ b/src/uk/ac/ox/cs/pagoda/endomorph/DependencyGraph.java | |||
| @@ -240,6 +240,11 @@ public class DependencyGraph { | |||
| 240 | private boolean checkHomomorphism(NodeTuple u, NodeTuple v) { | 240 | private boolean checkHomomorphism(NodeTuple u, NodeTuple v) { |
| 241 | ++homomorphismCheckCounter; | 241 | ++homomorphismCheckCounter; |
| 242 | homomorphismChecker.setMapping(u, v); | 242 | homomorphismChecker.setMapping(u, v); |
| 243 | |||
| 244 | // TODO recently added, test it | ||
| 245 | if(!homomorphismChecker.isMappingTo(u, v)) | ||
| 246 | return false; | ||
| 247 | |||
| 243 | try { | 248 | try { |
| 244 | Node node1, node2; | 249 | Node node1, node2; |
| 245 | for (Iterator<Node> iter1 = u.getNodes().iterator(), iter2 = v.getNodes().iterator(); iter1.hasNext(); ) { | 250 | for (Iterator<Node> iter1 = u.getNodes().iterator(), iter2 = v.getNodes().iterator(); iter1.hasNext(); ) { |
| @@ -251,7 +256,7 @@ public class DependencyGraph { | |||
| 251 | } | 256 | } |
| 252 | return true; | 257 | return true; |
| 253 | } finally { | 258 | } finally { |
| 254 | homomorphismChecker.clearMappings(); | 259 | homomorphismChecker.clearMappings(); |
| 255 | } | 260 | } |
| 256 | } | 261 | } |
| 257 | 262 | ||
