#23 #25 #28 I was able to fix some bugs and increase performance again

I have a new kind of pattern matching, that kind of resembles my
CSP-based isomorphism check algorithm. It is running pretty fast - at
least in comparison to my old algorithm and the current tests I'm using.

Also it does now work correctly as it seems, even for the stranger ones
of the negative-node-bearing rules I just came across.

I'll try to implement all those RoadWorkExample patterns using it, and I
hope it won't cause any major bugs again, like the ones I just fixed.

src/test/java/org/fujaba/graphengine/unitTests/RoadworkExample.java

@@ -122,7 +122,7 @@ public void test() {
 	    arrayList.get(0).add(createCarsAtWestPattern);
 	    arrayList.get(0).add(createCarsAtEastPattern);
 
-        GraphEngine.setMainIsomorphismHandler(new IsomorphismHandlerCombinatorial());
+//        GraphEngine.setMainIsomorphismHandler(new IsomorphismHandlerCombinatorial());
 
 	    Graph reachabilityGraph = PatternEngine.calculateReachabilityGraph(startGraph, arrayList);