refactor: move ITC algorithms

Since only RETE uses ITC, we may move ITC into the RETE project. Also removes unused ITC algorithms.
author: Kristóf Marussy <kristof@marussy.com> 2023-08-19 03:56:39 +0200
committer: Kristóf Marussy <kristof@marussy.com> 2023-08-19 03:56:39 +0200
commit: 6e11ebab0aa0dca1de5475761978073dd849aa36 (patch)
tree: a96f4caa74a10e799506fceae848b667de2e2d19
parent: refactor: apply local search fixes to VIATRA (diff)
download: refinery-6e11ebab0aa0dca1de5475761978073dd849aa36.tar.gz
refinery-6e11ebab0aa0dca1de5475761978073dd849aa36.tar.zst
refinery-6e11ebab0aa0dca1de5475761978073dd849aa36.zip
39 files changed, 226 insertions, 1004 deletions
diff --git a/subprojects/viatra-runtime-rete/src/main/java/tools/refinery/viatra/runtime/rete/index/TransitiveClosureNodeIndexer.java b/subprojects/viatra-runtime-rete/src/main/java/tools/refinery/viatra/runtime/rete/index/TransitiveClosureNodeIndexer.java
index b0bea8cb..77202004 100644
--- a/subprojects/viatra-runtime-rete/src/main/java/tools/refinery/viatra/runtime/rete/index/TransitiveClosureNodeIndexer.java
+++ b/subprojects/viatra-runtime-rete/src/main/java/tools/refinery/viatra/runtime/rete/index/TransitiveClosureNodeIndexer.java
@@ -3,7 +3,7 @@
 * This program and the accompanying materials are made available under the
 * terms of the Eclipse Public License v. 2.0 which is available at
 * http://www.eclipse.org/legal/epl-v20.html.
- * 
+ *
 * SPDX-License-Identifier: EPL-2.0
 *******************************************************************************/
 package tools.refinery.viatra.runtime.rete.index;
@@ -13,7 +13,7 @@ import java.util.Collections;
 import java.util.Iterator;
 import java.util.Set;
-import tools.refinery.viatra.runtime.base.itc.alg.incscc.IncSCCAlg;
+import tools.refinery.viatra.runtime.rete.itc.alg.incscc.IncSCCAlg;
 import tools.refinery.viatra.runtime.matchers.tuple.MaskedTuple;
 import tools.refinery.viatra.runtime.matchers.tuple.Tuple;
 import tools.refinery.viatra.runtime.matchers.tuple.TupleMask;
@@ -86,21 +86,21 @@ public class TransitiveClosureNodeIndexer extends StandardIndexer implements Ite
    public int getBucketCount() {
        throw new UnsupportedOperationException();
    }
-    
    @Override
    public Collection<Tuple> getSignatures() {
        return asTupleCollection(tcAlg.getTcRelation());
    }
-    
    @Override
    public Iterator<Tuple> iterator() {
        return asTupleCollection(tcAlg.getTcRelation()).iterator();
    }
    private Collection<Tuple> asTupleCollection(
-            Collection<tools.refinery.viatra.runtime.base.itc.alg.misc.Tuple<Object>> tuples) {
+            Collection<tools.refinery.viatra.runtime.rete.itc.alg.misc.Tuple<Object>> tuples) {
        Set<Tuple> retSet = CollectionsFactory.createSet();
-        for (tools.refinery.viatra.runtime.base.itc.alg.misc.Tuple<Object> tuple : tuples) {
+        for (tools.refinery.viatra.runtime.rete.itc.alg.misc.Tuple<Object> tuple : tuples) {
            retSet.add(Tuples.staticArityFlatTupleOf(tuple.getSource(), tuple.getTarget()));
        }
        return retSet;
@@ -117,5 +117,5 @@ public class TransitiveClosureNodeIndexer extends StandardIndexer implements Ite
    public Receiver getActiveNode() {
        return tcNode;
    }
-    
 }
diff --git a/subprojects/viatra-runtime/src/main/java/tools/refinery/viatra/runtime/base/itc/alg/counting/CountingAlg.java b/subprojects/viatra-runtime-rete/src/main/java/tools/refinery/viatra/runtime/rete/itc/alg/counting/CountingAlg.java
index d0367cde..199b44b1 100644
--- a/subprojects/viatra-runtime/src/main/java/tools/refinery/viatra/runtime/base/itc/alg/counting/CountingAlg.java
+++ b/subprojects/viatra-runtime-rete/src/main/java/tools/refinery/viatra/runtime/rete/itc/alg/counting/CountingAlg.java
@@ -3,32 +3,32 @@
 * This program and the accompanying materials are made available under the
 * terms of the Eclipse Public License v. 2.0 which is available at
 * http://www.eclipse.org/legal/epl-v20.html.
- * 
+ *
 * SPDX-License-Identifier: EPL-2.0
 *******************************************************************************/
-package tools.refinery.viatra.runtime.base.itc.alg.counting;
+package tools.refinery.viatra.runtime.rete.itc.alg.counting;
 import java.util.List;
 import java.util.Set;
-import tools.refinery.viatra.runtime.base.itc.alg.misc.DFSPathFinder;
+import tools.refinery.viatra.runtime.rete.itc.alg.misc.DFSPathFinder;
-import tools.refinery.viatra.runtime.base.itc.alg.misc.IGraphPathFinder;
+import tools.refinery.viatra.runtime.rete.itc.alg.misc.IGraphPathFinder;
-import tools.refinery.viatra.runtime.base.itc.alg.misc.ITcRelation;
+import tools.refinery.viatra.runtime.rete.itc.alg.misc.ITcRelation;
-import tools.refinery.viatra.runtime.base.itc.igraph.IBiDirectionalGraphDataSource;
+import tools.refinery.viatra.runtime.rete.itc.igraph.IBiDirectionalGraphDataSource;
-import tools.refinery.viatra.runtime.base.itc.igraph.IBiDirectionalWrapper;
+import tools.refinery.viatra.runtime.rete.itc.igraph.IBiDirectionalWrapper;
-import tools.refinery.viatra.runtime.base.itc.igraph.IGraphDataSource;
+import tools.refinery.viatra.runtime.rete.itc.igraph.IGraphDataSource;
-import tools.refinery.viatra.runtime.base.itc.igraph.IGraphObserver;
+import tools.refinery.viatra.runtime.rete.itc.igraph.IGraphObserver;
-import tools.refinery.viatra.runtime.base.itc.igraph.ITcDataSource;
+import tools.refinery.viatra.runtime.rete.itc.igraph.ITcDataSource;
-import tools.refinery.viatra.runtime.base.itc.igraph.ITcObserver;
+import tools.refinery.viatra.runtime.rete.itc.igraph.ITcObserver;
 import tools.refinery.viatra.runtime.matchers.util.CollectionsFactory;
 import tools.refinery.viatra.runtime.matchers.util.IMemoryView;
 /**
 * This class is the optimized implementation of the Counting algorithm.
- * 
+ *
 * @author Tamas Szabo
- * 
+ *
 * @param <V>
 *            the type parameter of the nodes in the graph data source
 */
@@ -41,7 +41,7 @@ public class CountingAlg<V> implements IGraphObserver<V>, ITcDataSource<V> {
    /**
     * Constructs a new Counting algorithm and initializes the transitive closure relation with the given graph data
     * source. Attach itself on the graph data source as an observer.
-     * 
+     *
     * @param gds
     *            the graph data source instance
     */
@@ -93,7 +93,7 @@ public class CountingAlg<V> implements IGraphObserver<V>, ITcDataSource<V> {
    /**
     * Derives the transitive closure relation when an edge is inserted or deleted.
-     * 
+     *
     * @param source
     *            the source of the edge
     * @param target
@@ -133,7 +133,7 @@ public class CountingAlg<V> implements IGraphObserver<V>, ITcDataSource<V> {
        CountingTcRelation<V> newTuples = dtc;
        CountingTcRelation<V> tmp = null;
        dtc = new CountingTcRelation<V>(false);
-        
        IMemoryView<V> nodes = null;
        while (!newTuples.isEmpty()) {
@@ -223,4 +223,4 @@ public class CountingAlg<V> implements IGraphObserver<V>, ITcDataSource<V> {
    public IGraphPathFinder<V> getPathFinder() {
        return new DFSPathFinder<V>(gds, this);
    }
-}
-\ No newline at end of file
+}
diff --git a/subprojects/viatra-runtime/src/main/java/tools/refinery/viatra/runtime/base/itc/alg/counting/CountingTcRelation.java b/subprojects/viatra-runtime-rete/src/main/java/tools/refinery/viatra/runtime/rete/itc/alg/counting/CountingTcRelation.java
index 44abbc3d..474c7461 100644
--- a/subprojects/viatra-runtime/src/main/java/tools/refinery/viatra/runtime/base/itc/alg/counting/CountingTcRelation.java
+++ b/subprojects/viatra-runtime-rete/src/main/java/tools/refinery/viatra/runtime/rete/itc/alg/counting/CountingTcRelation.java
@@ -7,15 +7,15 @@
 * SPDX-License-Identifier: EPL-2.0
 *******************************************************************************/
-package tools.refinery.viatra.runtime.base.itc.alg.counting;
+package tools.refinery.viatra.runtime.rete.itc.alg.counting;
 import java.util.Collections;
 import java.util.List;
 import java.util.Set;
-import tools.refinery.viatra.runtime.base.itc.alg.misc.topsort.TopologicalSorting;
+import tools.refinery.viatra.runtime.rete.itc.alg.misc.topsort.TopologicalSorting;
-import tools.refinery.viatra.runtime.base.itc.alg.misc.ITcRelation;
+import tools.refinery.viatra.runtime.rete.itc.alg.misc.ITcRelation;
-import tools.refinery.viatra.runtime.base.itc.igraph.IBiDirectionalGraphDataSource;
+import tools.refinery.viatra.runtime.rete.itc.igraph.IBiDirectionalGraphDataSource;
 import tools.refinery.viatra.runtime.matchers.util.CollectionsFactory;
 import tools.refinery.viatra.runtime.matchers.util.CollectionsFactory.MemoryType;
 import tools.refinery.viatra.runtime.matchers.util.IMemoryView;
diff --git a/subprojects/viatra-runtime/src/main/java/tools/refinery/viatra/runtime/base/itc/alg/incscc/CountingListener.java b/subprojects/viatra-runtime-rete/src/main/java/tools/refinery/viatra/runtime/rete/itc/alg/incscc/CountingListener.java
index fdf64f77..7d507d82 100644
--- a/subprojects/viatra-runtime/src/main/java/tools/refinery/viatra/runtime/base/itc/alg/incscc/CountingListener.java
+++ b/subprojects/viatra-runtime-rete/src/main/java/tools/refinery/viatra/runtime/rete/itc/alg/incscc/CountingListener.java
@@ -3,17 +3,17 @@
 * This program and the accompanying materials are made available under the
 * terms of the Eclipse Public License v. 2.0 which is available at
 * http://www.eclipse.org/legal/epl-v20.html.
- * 
+ *
 * SPDX-License-Identifier: EPL-2.0
 *******************************************************************************/
-package tools.refinery.viatra.runtime.base.itc.alg.incscc;
+package tools.refinery.viatra.runtime.rete.itc.alg.incscc;
-import tools.refinery.viatra.runtime.base.itc.igraph.ITcObserver;
+import tools.refinery.viatra.runtime.rete.itc.igraph.ITcObserver;
 import tools.refinery.viatra.runtime.matchers.util.Direction;
 /**
 * @author Tamas Szabo
- * 
+ *
 */
 public class CountingListener<V> implements ITcObserver<V> {
@@ -33,4 +33,4 @@ public class CountingListener<V> implements ITcObserver<V> {
        alg.notifyTcObservers(alg.sccs.getPartition(source), alg.sccs.getPartition(target), Direction.DELETE);
    }
-}
-\ No newline at end of file
+}
diff --git a/subprojects/viatra-runtime/src/main/java/tools/refinery/viatra/runtime/base/itc/alg/incscc/IncSCCAlg.java b/subprojects/viatra-runtime-rete/src/main/java/tools/refinery/viatra/runtime/rete/itc/alg/incscc/IncSCCAlg.java
index 5d720e75..774e55eb 100644
--- a/subprojects/viatra-runtime/src/main/java/tools/refinery/viatra/runtime/base/itc/alg/incscc/IncSCCAlg.java
+++ b/subprojects/viatra-runtime-rete/src/main/java/tools/refinery/viatra/runtime/rete/itc/alg/incscc/IncSCCAlg.java
@@ -7,38 +7,26 @@
 * SPDX-License-Identifier: EPL-2.0
 *******************************************************************************/
-package tools.refinery.viatra.runtime.base.itc.alg.incscc;
+package tools.refinery.viatra.runtime.rete.itc.alg.incscc;
-import java.util.ArrayList;
-import java.util.HashSet;
-import java.util.Iterator;
-import java.util.List;
-import java.util.Map;
-import java.util.Map.Entry;
-import java.util.Objects;
-import java.util.Set;
-import tools.refinery.viatra.runtime.base.itc.alg.counting.CountingAlg;
-import tools.refinery.viatra.runtime.base.itc.alg.misc.bfs.BFS;
-import tools.refinery.viatra.runtime.base.itc.alg.misc.scc.SCC;
-import tools.refinery.viatra.runtime.base.itc.alg.misc.scc.SCCResult;
-import tools.refinery.viatra.runtime.base.itc.alg.util.CollectionHelper;
-import tools.refinery.viatra.runtime.base.itc.alg.dred.DRedTcRelation;
-import tools.refinery.viatra.runtime.base.itc.alg.misc.DFSPathFinder;
-import tools.refinery.viatra.runtime.base.itc.alg.misc.GraphHelper;
-import tools.refinery.viatra.runtime.base.itc.alg.misc.IGraphPathFinder;
-import tools.refinery.viatra.runtime.base.itc.alg.misc.Tuple;
-import tools.refinery.viatra.runtime.base.itc.graphimpl.Graph;
-import tools.refinery.viatra.runtime.base.itc.igraph.IBiDirectionalGraphDataSource;
-import tools.refinery.viatra.runtime.base.itc.igraph.IBiDirectionalWrapper;
-import tools.refinery.viatra.runtime.base.itc.igraph.IGraphDataSource;
-import tools.refinery.viatra.runtime.base.itc.igraph.IGraphObserver;
-import tools.refinery.viatra.runtime.base.itc.igraph.ITcDataSource;
-import tools.refinery.viatra.runtime.base.itc.igraph.ITcObserver;
 import tools.refinery.viatra.runtime.matchers.algorithms.UnionFind;
 import tools.refinery.viatra.runtime.matchers.util.CollectionsFactory;
 import tools.refinery.viatra.runtime.matchers.util.Direction;
 import tools.refinery.viatra.runtime.matchers.util.IMemoryView;
+import tools.refinery.viatra.runtime.rete.itc.alg.counting.CountingAlg;
+import tools.refinery.viatra.runtime.rete.itc.alg.misc.DFSPathFinder;
+import tools.refinery.viatra.runtime.rete.itc.alg.misc.GraphHelper;
+import tools.refinery.viatra.runtime.rete.itc.alg.misc.IGraphPathFinder;
+import tools.refinery.viatra.runtime.rete.itc.alg.misc.Tuple;
+import tools.refinery.viatra.runtime.rete.itc.alg.misc.bfs.BFS;
+import tools.refinery.viatra.runtime.rete.itc.alg.misc.scc.SCC;
+import tools.refinery.viatra.runtime.rete.itc.alg.misc.scc.SCCResult;
+import tools.refinery.viatra.runtime.rete.itc.alg.util.CollectionHelper;
+import tools.refinery.viatra.runtime.rete.itc.graphimpl.Graph;
+import tools.refinery.viatra.runtime.rete.itc.igraph.*;
+import java.util.*;
+import java.util.Map.Entry;
 /**
 * Incremental SCC maintenance + counting algorithm.
@@ -438,30 +426,6 @@ public class IncSCCAlg<V> implements IGraphObserver<V>, ITcDataSource<V> {
        }
    }
-    // for JUnit
-    public boolean checkTcRelation(DRedTcRelation<V> tc) {
-        for (V s : tc.getTupleStarts()) {
-            for (V t : tc.getTupleEnds(s)) {
-                if (!isReachable(s, t))
-                    return false;
-            }
-        }
-        for (V root : counting.getTcRelation().getTupleStarts()) {
-            for (V end : counting.getTcRelation().getTupleEnds(root)) {
-                for (V s : sccs.getPartition(root)) {
-                    for (V t : sccs.getPartition(end)) {
-                        if (!tc.containsTuple(s, t))
-                            return false;
-                    }
-                }
-            }
-        }
-        return true;
-    }
    /**
     * Return the SCCs from which the SCC represented by the root node is reachable. Note that an SCC can be present
     * multiple times in the returned list (multiple edges between the two SCCs).
diff --git a/subprojects/viatra-runtime/src/main/java/tools/refinery/viatra/runtime/base/itc/alg/misc/DFSPathFinder.java b/subprojects/viatra-runtime-rete/src/main/java/tools/refinery/viatra/runtime/rete/itc/alg/misc/DFSPathFinder.java
index 51017b1a..2cec33a2 100644
--- a/subprojects/viatra-runtime/src/main/java/tools/refinery/viatra/runtime/base/itc/alg/misc/DFSPathFinder.java
+++ b/subprojects/viatra-runtime-rete/src/main/java/tools/refinery/viatra/runtime/rete/itc/alg/misc/DFSPathFinder.java
@@ -3,10 +3,10 @@
 * This program and the accompanying materials are made available under the
 * terms of the Eclipse Public License v. 2.0 which is available at
 * http://www.eclipse.org/legal/epl-v20.html.
- * 
+ *
 * SPDX-License-Identifier: EPL-2.0
 *******************************************************************************/
-package tools.refinery.viatra.runtime.base.itc.alg.misc;
+package tools.refinery.viatra.runtime.rete.itc.alg.misc;
 import java.util.ArrayList;
 import java.util.Deque;
@@ -16,17 +16,17 @@ import java.util.LinkedList;
 import java.util.List;
 import java.util.Set;
-import tools.refinery.viatra.runtime.base.itc.igraph.IGraphDataSource;
+import tools.refinery.viatra.runtime.rete.itc.igraph.IGraphDataSource;
-import tools.refinery.viatra.runtime.base.itc.igraph.ITcDataSource;
+import tools.refinery.viatra.runtime.rete.itc.igraph.ITcDataSource;
 import tools.refinery.viatra.runtime.matchers.util.IMemoryView;
 /**
 * A depth-first search implementation of the {@link IGraphPathFinder}.
- * 
+ *
 * TODO use ITC to filter nodes that must be traversed, instead of checks
- * 
+ *
 * @author Abel Hegedus
- * 
+ *
 * @param <V>
 *            the node type of the graph
 */
diff --git a/subprojects/viatra-runtime/src/main/java/tools/refinery/viatra/runtime/base/itc/alg/misc/Edge.java b/subprojects/viatra-runtime-rete/src/main/java/tools/refinery/viatra/runtime/rete/itc/alg/misc/Edge.java
index cf68d36a..862c99b3 100644
--- a/subprojects/viatra-runtime/src/main/java/tools/refinery/viatra/runtime/base/itc/alg/misc/Edge.java
+++ b/subprojects/viatra-runtime-rete/src/main/java/tools/refinery/viatra/runtime/rete/itc/alg/misc/Edge.java
@@ -3,11 +3,11 @@
 * This program and the accompanying materials are made available under the
 * terms of the Eclipse Public License v. 2.0 which is available at
 * http://www.eclipse.org/legal/epl-v20.html.
- * 
+ *
 * SPDX-License-Identifier: EPL-2.0
 *******************************************************************************/
-package tools.refinery.viatra.runtime.base.itc.alg.misc;
+package tools.refinery.viatra.runtime.rete.itc.alg.misc;
 public class Edge<V> {
    private V source;
diff --git a/subprojects/viatra-runtime/src/main/java/tools/refinery/viatra/runtime/base/itc/alg/misc/GraphHelper.java b/subprojects/viatra-runtime-rete/src/main/java/tools/refinery/viatra/runtime/rete/itc/alg/misc/GraphHelper.java
index 194e979b..b79e4d45 100644
--- a/subprojects/viatra-runtime/src/main/java/tools/refinery/viatra/runtime/base/itc/alg/misc/GraphHelper.java
+++ b/subprojects/viatra-runtime-rete/src/main/java/tools/refinery/viatra/runtime/rete/itc/alg/misc/GraphHelper.java
@@ -3,35 +3,31 @@
 * This program and the accompanying materials are made available under the
 * terms of the Eclipse Public License v. 2.0 which is available at
 * http://www.eclipse.org/legal/epl-v20.html.
- * 
+ *
 * SPDX-License-Identifier: EPL-2.0
 *******************************************************************************/
-package tools.refinery.viatra.runtime.base.itc.alg.misc;
+package tools.refinery.viatra.runtime.rete.itc.alg.misc;
-import java.util.ArrayList;
-import java.util.Collection;
-import java.util.HashSet;
-import java.util.List;
-import java.util.Map.Entry;
-import java.util.Set;
-import tools.refinery.viatra.runtime.base.itc.graphimpl.Graph;
-import tools.refinery.viatra.runtime.base.itc.igraph.IBiDirectionalGraphDataSource;
-import tools.refinery.viatra.runtime.base.itc.igraph.IGraphDataSource;
 import tools.refinery.viatra.runtime.matchers.util.IMemoryView;
+import tools.refinery.viatra.runtime.rete.itc.graphimpl.Graph;
+import tools.refinery.viatra.runtime.rete.itc.igraph.IBiDirectionalGraphDataSource;
+import tools.refinery.viatra.runtime.rete.itc.igraph.IGraphDataSource;
+import java.util.*;
+import java.util.Map.Entry;
 /**
 * Utility class for graph related operations.
- * 
+ *
 * @author Tamas Szabo
 */
 public class GraphHelper {
    private GraphHelper() {/*Utility class constructor*/}
-    
    /**
     * Returns the subgraph from the given {@link IBiDirectionalGraphDataSource} which contains the given set of nodes.
-     * 
+     *
     * @param nodesInSubGraph
     *            the nodes that are present in the subgraph
     * @param graphDataSource
@@ -65,11 +61,11 @@ public class GraphHelper {
    /**
     * Constructs a path between source and target in the given graph. Both the {@link IGraphDataSource} and the set of
     * nodes are used, this way it is possible to construct a path in a given subgraph.
-     * 
+     *
     * The returned {@link List} contains the nodes along the path (this means that there is an edge in the graph
     * between two consecutive nodes). A self loop (one edge) is indicated with the source node being present two times
     * in the returned {@link List}.
-     * 
+     *
     * @param source
     *            the source node
     * @param target
@@ -140,7 +136,7 @@ public class GraphHelper {
    /**
     * Returns the number of self-loop edges for the given node.
-     * 
+     *
     * @param node
     *            the node
     * @param graphDataSource
@@ -153,7 +149,7 @@ public class GraphHelper {
    /**
     * Returns the number of edges between the given source and target nodes.
-     * 
+     *
     * @param source
     *            the source node
     * @param target
diff --git a/subprojects/viatra-runtime/src/main/java/tools/refinery/viatra/runtime/base/itc/alg/misc/IGraphPathFinder.java b/subprojects/viatra-runtime-rete/src/main/java/tools/refinery/viatra/runtime/rete/itc/alg/misc/IGraphPathFinder.java
index cebb09c8..624f9f7d 100644
--- a/subprojects/viatra-runtime/src/main/java/tools/refinery/viatra/runtime/base/itc/alg/misc/IGraphPathFinder.java
+++ b/subprojects/viatra-runtime-rete/src/main/java/tools/refinery/viatra/runtime/rete/itc/alg/misc/IGraphPathFinder.java
@@ -3,20 +3,20 @@
 * This program and the accompanying materials are made available under the
 * terms of the Eclipse Public License v. 2.0 which is available at
 * http://www.eclipse.org/legal/epl-v20.html.
- * 
+ *
 * SPDX-License-Identifier: EPL-2.0
 *******************************************************************************/
-package tools.refinery.viatra.runtime.base.itc.alg.misc;
+package tools.refinery.viatra.runtime.rete.itc.alg.misc;
 import java.util.Deque;
 import java.util.Set;
-import tools.refinery.viatra.runtime.base.itc.igraph.ITcDataSource;
+import tools.refinery.viatra.runtime.rete.itc.igraph.ITcDataSource;
 /**
- * The path finder provides methods for retrieving paths in a graph between a source node and one or more target nodes.  
+ * The path finder provides methods for retrieving paths in a graph between a source node and one or more target nodes.
 * Use {@link ITcDataSource#getPathFinder()} for instantiating.
- * 
+ *
 * @author Abel Hegedus
 *
 * @param <V> the node type of the graph
@@ -26,7 +26,7 @@ public interface IGraphPathFinder<V> {
    /**
     * Returns an arbitrary path from the source node to the target node (if such exists). If there is no path
     * between them, an empty collection is returned.
-     * 
+     *
     * @param sourceNode the source node of the path
     * @param targetNode the target node of the path
     * @return the path from the source to the target, or empty collection if target is not reachable from source.
@@ -36,17 +36,17 @@ public interface IGraphPathFinder<V> {
    /**
     * Returns the collection of shortest paths from the source node to the target node (if such exists). If there is no path
     * between them, an empty collection is returned.
-     * 
+     *
     * @param sourceNode the source node of the path
     * @param targetNode the target node of the path
     * @return the collection of shortest paths from the source to the target, or empty collection if target is not reachable from source.
     */
    Iterable<Deque<V>> getShortestPaths(V sourceNode, V targetNode);
-    
    /**
     * Returns the collection of paths from the source node to the target node (if such exists). If there is no path
     * between them, an empty collection is returned.
-     * 
+     *
     * @param sourceNode the source node of the path
     * @param targetNode the target node of the path
     * @return the collection of paths from the source to the target, or empty collection if target is not reachable from source.
@@ -56,12 +56,12 @@ public interface IGraphPathFinder<V> {
    /**
     * Returns the collection of paths from the source node to any of the target nodes (if such exists). If there is no path
     * between them, an empty collection is returned.
-     * 
+     *
     * @param sourceNode the source node of the path
     * @param targetNodes the set of target nodes of the paths
     * @return the collection of paths from the source to any of the targets, or empty collection if neither target is reachable from source.
     */
    Iterable<Deque<V>> getAllPathsToTargets(V sourceNode, Set<V> targetNodes);
-    
-}
-\ No newline at end of file
+}
diff --git a/subprojects/viatra-runtime/src/main/java/tools/refinery/viatra/runtime/base/itc/alg/misc/ITcRelation.java b/subprojects/viatra-runtime-rete/src/main/java/tools/refinery/viatra/runtime/rete/itc/alg/misc/ITcRelation.java
index a41ff6c7..9fd85ae1 100644
--- a/subprojects/viatra-runtime/src/main/java/tools/refinery/viatra/runtime/base/itc/alg/misc/ITcRelation.java
+++ b/subprojects/viatra-runtime-rete/src/main/java/tools/refinery/viatra/runtime/rete/itc/alg/misc/ITcRelation.java
@@ -3,11 +3,11 @@
 * This program and the accompanying materials are made available under the
 * terms of the Eclipse Public License v. 2.0 which is available at
 * http://www.eclipse.org/legal/epl-v20.html.
- * 
+ *
 * SPDX-License-Identifier: EPL-2.0
 *******************************************************************************/
-package tools.refinery.viatra.runtime.base.itc.alg.misc;
+package tools.refinery.viatra.runtime.rete.itc.alg.misc;
 import java.util.Set;
@@ -15,14 +15,14 @@ public interface ITcRelation<V> {
    /**
     * Returns the starting nodes from a transitive closure relation.
-     * 
+     *
     * @return the set of starting nodes
     */
    public Set<V> getTupleStarts();
    /**
     * Returns the set of nodes that are reachable from the given node.
-     * 
+     *
     * @param start
     *            the starting node
     * @return the set of reachable nodes
diff --git a/subprojects/viatra-runtime/src/main/java/tools/refinery/viatra/runtime/base/itc/alg/misc/Tuple.java b/subprojects/viatra-runtime-rete/src/main/java/tools/refinery/viatra/runtime/rete/itc/alg/misc/Tuple.java
index a2d54a59..84c79dcf 100644
--- a/subprojects/viatra-runtime/src/main/java/tools/refinery/viatra/runtime/base/itc/alg/misc/Tuple.java
+++ b/subprojects/viatra-runtime-rete/src/main/java/tools/refinery/viatra/runtime/rete/itc/alg/misc/Tuple.java
@@ -3,11 +3,11 @@
 * This program and the accompanying materials are made available under the
 * terms of the Eclipse Public License v. 2.0 which is available at
 * http://www.eclipse.org/legal/epl-v20.html.
- * 
+ *
 * SPDX-License-Identifier: EPL-2.0
 *******************************************************************************/
-package tools.refinery.viatra.runtime.base.itc.alg.misc;
+package tools.refinery.viatra.runtime.rete.itc.alg.misc;
 public class Tuple<V> {
diff --git a/subprojects/viatra-runtime/src/main/java/tools/refinery/viatra/runtime/base/itc/alg/misc/bfs/BFS.java b/subprojects/viatra-runtime-rete/src/main/java/tools/refinery/viatra/runtime/rete/itc/alg/misc/bfs/BFS.java
index 798f31d2..00b0a96d 100644
--- a/subprojects/viatra-runtime/src/main/java/tools/refinery/viatra/runtime/base/itc/alg/misc/bfs/BFS.java
+++ b/subprojects/viatra-runtime-rete/src/main/java/tools/refinery/viatra/runtime/rete/itc/alg/misc/bfs/BFS.java
@@ -3,27 +3,27 @@
 * This program and the accompanying materials are made available under the
 * terms of the Eclipse Public License v. 2.0 which is available at
 * http://www.eclipse.org/legal/epl-v20.html.
- * 
+ *
 * SPDX-License-Identifier: EPL-2.0
 *******************************************************************************/
-package tools.refinery.viatra.runtime.base.itc.alg.misc.bfs;
+package tools.refinery.viatra.runtime.rete.itc.alg.misc.bfs;
+import tools.refinery.viatra.runtime.rete.itc.igraph.IBiDirectionalGraphDataSource;
+import tools.refinery.viatra.runtime.rete.itc.igraph.IGraphDataSource;
 import java.util.ArrayList;
 import java.util.HashSet;
 import java.util.List;
 import java.util.Set;
-import tools.refinery.viatra.runtime.base.itc.igraph.IBiDirectionalGraphDataSource;
-import tools.refinery.viatra.runtime.base.itc.igraph.IGraphDataSource;
 public class BFS<V> {
    private BFS() {/*Utility class constructor*/}
-    
    /**
     * Performs a breadth first search on the given graph to determine whether source is reachable from target.
-     * 
+     *
     * @param <V>
     *            the type parameter of the nodes in the graph
     * @param source
@@ -114,7 +114,7 @@ public class BFS<V> {
    /**
     * Performs a breadth first search on the given graph and collects all the nodes along the path from source to
     * target if such path exists.
-     * 
+     *
     * @param <V>
     *            the type parameter of the nodes in the graph
     * @param source
diff --git a/subprojects/viatra-runtime/src/main/java/tools/refinery/viatra/runtime/base/itc/alg/misc/scc/PKAlg.java b/subprojects/viatra-runtime-rete/src/main/java/tools/refinery/viatra/runtime/rete/itc/alg/misc/scc/PKAlg.java
index c99a48ab..892d048e 100644
--- a/subprojects/viatra-runtime/src/main/java/tools/refinery/viatra/runtime/base/itc/alg/misc/scc/PKAlg.java
+++ b/subprojects/viatra-runtime-rete/src/main/java/tools/refinery/viatra/runtime/rete/itc/alg/misc/scc/PKAlg.java
@@ -3,11 +3,11 @@
 * This program and the accompanying materials are made available under the
 * terms of the Eclipse Public License v. 2.0 which is available at
 * http://www.eclipse.org/legal/epl-v20.html.
- * 
+ *
 * SPDX-License-Identifier: EPL-2.0
 *******************************************************************************/
-package tools.refinery.viatra.runtime.base.itc.alg.misc.scc;
+package tools.refinery.viatra.runtime.rete.itc.alg.misc.scc;
 import java.util.ArrayList;
 import java.util.Collections;
@@ -15,10 +15,10 @@ import java.util.HashMap;
 import java.util.List;
 import java.util.Map;
-import tools.refinery.viatra.runtime.base.itc.igraph.IBiDirectionalGraphDataSource;
+import tools.refinery.viatra.runtime.rete.itc.igraph.IBiDirectionalGraphDataSource;
-import tools.refinery.viatra.runtime.base.itc.igraph.IBiDirectionalWrapper;
+import tools.refinery.viatra.runtime.rete.itc.igraph.IBiDirectionalWrapper;
-import tools.refinery.viatra.runtime.base.itc.igraph.IGraphDataSource;
+import tools.refinery.viatra.runtime.rete.itc.igraph.IGraphDataSource;
-import tools.refinery.viatra.runtime.base.itc.igraph.IGraphObserver;
+import tools.refinery.viatra.runtime.rete.itc.igraph.IGraphObserver;
 public class PKAlg<V> implements IGraphObserver<V> {
diff --git a/subprojects/viatra-runtime/src/main/java/tools/refinery/viatra/runtime/base/itc/alg/misc/scc/SCC.java b/subprojects/viatra-runtime-rete/src/main/java/tools/refinery/viatra/runtime/rete/itc/alg/misc/scc/SCC.java
index 8915998b..f6ef9847 100644
--- a/subprojects/viatra-runtime/src/main/java/tools/refinery/viatra/runtime/base/itc/alg/misc/scc/SCC.java
+++ b/subprojects/viatra-runtime-rete/src/main/java/tools/refinery/viatra/runtime/rete/itc/alg/misc/scc/SCC.java
@@ -3,37 +3,37 @@
 * This program and the accompanying materials are made available under the
 * terms of the Eclipse Public License v. 2.0 which is available at
 * http://www.eclipse.org/legal/epl-v20.html.
- * 
+ *
 * SPDX-License-Identifier: EPL-2.0
 *******************************************************************************/
-package tools.refinery.viatra.runtime.base.itc.alg.misc.scc;
+package tools.refinery.viatra.runtime.rete.itc.alg.misc.scc;
 import java.util.HashSet;
 import java.util.Map;
 import java.util.Set;
 import java.util.Stack;
-import tools.refinery.viatra.runtime.base.itc.igraph.IGraphDataSource;
+import tools.refinery.viatra.runtime.rete.itc.igraph.IGraphDataSource;
 import tools.refinery.viatra.runtime.matchers.util.CollectionsFactory;
 /**
 * Efficient algorithms to compute the Strongly Connected Components in a directed graph.
- * 
+ *
 * @author Tamas Szabo
- * 
+ *
 * @param <V>
 *            the type parameter of the nodes in the graph
 */
 public class SCC<V> {
    private SCC() {/*Utility class constructor*/}
-    
    public static long sccId = 0;
    /**
     * Computes the SCCs for the given graph and returns them as a multiset. (Iterative version of Tarjan's algorithm)
-     * 
+     *
     * @param g
     *            the directed graph data source
     * @return the set of SCCs
diff --git a/subprojects/viatra-runtime/src/main/java/tools/refinery/viatra/runtime/base/itc/alg/misc/scc/SCCProperty.java b/subprojects/viatra-runtime-rete/src/main/java/tools/refinery/viatra/runtime/rete/itc/alg/misc/scc/SCCProperty.java
index b26e3d37..51ee834e 100644
--- a/subprojects/viatra-runtime/src/main/java/tools/refinery/viatra/runtime/base/itc/alg/misc/scc/SCCProperty.java
+++ b/subprojects/viatra-runtime-rete/src/main/java/tools/refinery/viatra/runtime/rete/itc/alg/misc/scc/SCCProperty.java
@@ -3,11 +3,11 @@
 * This program and the accompanying materials are made available under the
 * terms of the Eclipse Public License v. 2.0 which is available at
 * http://www.eclipse.org/legal/epl-v20.html.
- * 
+ *
 * SPDX-License-Identifier: EPL-2.0
 *******************************************************************************/
-package tools.refinery.viatra.runtime.base.itc.alg.misc.scc;
+package tools.refinery.viatra.runtime.rete.itc.alg.misc.scc;
 public class SCCProperty {
    private int index;
diff --git a/subprojects/viatra-runtime/src/main/java/tools/refinery/viatra/runtime/base/itc/alg/misc/scc/SCCResult.java b/subprojects/viatra-runtime-rete/src/main/java/tools/refinery/viatra/runtime/rete/itc/alg/misc/scc/SCCResult.java
index fde59d3b..2e511fd6 100644
--- a/subprojects/viatra-runtime/src/main/java/tools/refinery/viatra/runtime/base/itc/alg/misc/scc/SCCResult.java
+++ b/subprojects/viatra-runtime-rete/src/main/java/tools/refinery/viatra/runtime/rete/itc/alg/misc/scc/SCCResult.java
@@ -3,16 +3,16 @@
 * This program and the accompanying materials are made available under the
 * terms of the Eclipse Public License v. 2.0 which is available at
 * http://www.eclipse.org/legal/epl-v20.html.
- * 
+ *
 * SPDX-License-Identifier: EPL-2.0
 *******************************************************************************/
-package tools.refinery.viatra.runtime.base.itc.alg.misc.scc;
+package tools.refinery.viatra.runtime.rete.itc.alg.misc.scc;
 import java.util.Map.Entry;
 import java.util.Set;
-import tools.refinery.viatra.runtime.base.itc.igraph.IGraphDataSource;
+import tools.refinery.viatra.runtime.rete.itc.igraph.IGraphDataSource;
 public class SCCResult<V> {
diff --git a/subprojects/viatra-runtime/src/main/java/tools/refinery/viatra/runtime/base/itc/alg/misc/topsort/TopologicalSorting.java b/subprojects/viatra-runtime-rete/src/main/java/tools/refinery/viatra/runtime/rete/itc/alg/misc/topsort/TopologicalSorting.java
index dd18e6c8..db46d178 100644
--- a/subprojects/viatra-runtime/src/main/java/tools/refinery/viatra/runtime/base/itc/alg/misc/topsort/TopologicalSorting.java
+++ b/subprojects/viatra-runtime-rete/src/main/java/tools/refinery/viatra/runtime/rete/itc/alg/misc/topsort/TopologicalSorting.java
@@ -3,19 +3,15 @@
 * This program and the accompanying materials are made available under the
 * terms of the Eclipse Public License v. 2.0 which is available at
 * http://www.eclipse.org/legal/epl-v20.html.
- * 
+ *
 * SPDX-License-Identifier: EPL-2.0
 *******************************************************************************/
-package tools.refinery.viatra.runtime.base.itc.alg.misc.topsort;
+package tools.refinery.viatra.runtime.rete.itc.alg.misc.topsort;
-import java.util.HashSet;
+import tools.refinery.viatra.runtime.rete.itc.igraph.IGraphDataSource;
-import java.util.LinkedList;
-import java.util.List;
-import java.util.Set;
-import java.util.Stack;
-import tools.refinery.viatra.runtime.base.itc.igraph.IGraphDataSource;
+import java.util.*;
 /**
 * @since 1.6
@@ -23,7 +19,7 @@ import tools.refinery.viatra.runtime.base.itc.igraph.IGraphDataSource;
 public class TopologicalSorting {
    private TopologicalSorting() {/*Utility class constructor*/}
-    
    private static final class Pair<T> {
        public T element;
        public boolean isParent;
@@ -35,9 +31,9 @@ public class TopologicalSorting {
    }
    /**
-     * Returns a topological ordering for the given graph data source. 
+     * Returns a topological ordering for the given graph data source.
-     * Output format: if there is an a -> b (transitive) reachability, then node <code>a</code> will come before node <code>b</code> in the resulting list.  
+     * Output format: if there is an a -> b (transitive) reachability, then node <code>a</code> will come before node <code>b</code> in the resulting list.
-     * 
+     *
     * @param gds the graph data source
     * @return a topological ordering
     */
@@ -48,13 +44,13 @@ public class TopologicalSorting {
        for (final T node : gds.getAllNodes()) {
            if (!visited.contains(node)) {
-                dfsStack.push(new Pair<T>(node, false));                
+                dfsStack.push(new Pair<T>(node, false));
            }
-            
            while (!dfsStack.isEmpty()) {
                final Pair<T> head = dfsStack.pop();
                final T source = head.element;
-                
                if (head.isParent) {
                    // we have already seen source, push it to the resulting stack
                    result.addFirst(source);
@@ -62,7 +58,7 @@ public class TopologicalSorting {
                    // first time we see source, continue with its children
                    visited.add(source);
                    dfsStack.push(new Pair<T>(source, true));
-                    
                    for (final T target : gds.getTargetNodes(source).distinctValues()) {
                        if (!visited.contains(target)) {
                            dfsStack.push(new Pair<T>(target, false));
diff --git a/subprojects/viatra-runtime/src/main/java/tools/refinery/viatra/runtime/base/itc/alg/representative/RepresentativeElectionAlgorithm.java b/subprojects/viatra-runtime-rete/src/main/java/tools/refinery/viatra/runtime/rete/itc/alg/representative/RepresentativeElectionAlgorithm.java
index 51015404..5343f956 100644
--- a/subprojects/viatra-runtime/src/main/java/tools/refinery/viatra/runtime/base/itc/alg/representative/RepresentativeElectionAlgorithm.java
+++ b/subprojects/viatra-runtime-rete/src/main/java/tools/refinery/viatra/runtime/rete/itc/alg/representative/RepresentativeElectionAlgorithm.java
@@ -3,10 +3,10 @@
 *
 * SPDX-License-Identifier: EPL-2.0
 */
-package tools.refinery.viatra.runtime.base.itc.alg.representative;
+package tools.refinery.viatra.runtime.rete.itc.alg.representative;
-import tools.refinery.viatra.runtime.base.itc.graphimpl.Graph;
+import tools.refinery.viatra.runtime.rete.itc.graphimpl.Graph;
-import tools.refinery.viatra.runtime.base.itc.igraph.IGraphObserver;
+import tools.refinery.viatra.runtime.rete.itc.igraph.IGraphObserver;
 import tools.refinery.viatra.runtime.matchers.util.Direction;
 import java.util.HashMap;
diff --git a/subprojects/viatra-runtime/src/main/java/tools/refinery/viatra/runtime/base/itc/alg/representative/RepresentativeObserver.java b/subprojects/viatra-runtime-rete/src/main/java/tools/refinery/viatra/runtime/rete/itc/alg/representative/RepresentativeObserver.java
index 93cce1ea..6b772fa8 100644
--- a/subprojects/viatra-runtime/src/main/java/tools/refinery/viatra/runtime/base/itc/alg/representative/RepresentativeObserver.java
+++ b/subprojects/viatra-runtime-rete/src/main/java/tools/refinery/viatra/runtime/rete/itc/alg/representative/RepresentativeObserver.java
@@ -3,7 +3,7 @@
 *
 * SPDX-License-Identifier: EPL-2.0
 */
-package tools.refinery.viatra.runtime.base.itc.alg.representative;
+package tools.refinery.viatra.runtime.rete.itc.alg.representative;
 import tools.refinery.viatra.runtime.matchers.util.Direction;
diff --git a/subprojects/viatra-runtime/src/main/java/tools/refinery/viatra/runtime/base/itc/alg/representative/StronglyConnectedComponentAlgorithm.java b/subprojects/viatra-runtime-rete/src/main/java/tools/refinery/viatra/runtime/rete/itc/alg/representative/StronglyConnectedComponentAlgorithm.java
index ba42bb13..4acb2b77 100644
--- a/subprojects/viatra-runtime/src/main/java/tools/refinery/viatra/runtime/base/itc/alg/representative/StronglyConnectedComponentAlgorithm.java
+++ b/subprojects/viatra-runtime-rete/src/main/java/tools/refinery/viatra/runtime/rete/itc/alg/representative/StronglyConnectedComponentAlgorithm.java
@@ -3,12 +3,12 @@
 *
 * SPDX-License-Identifier: EPL-2.0
 */
-package tools.refinery.viatra.runtime.base.itc.alg.representative;
+package tools.refinery.viatra.runtime.rete.itc.alg.representative;
-import tools.refinery.viatra.runtime.base.itc.alg.misc.GraphHelper;
+import tools.refinery.viatra.runtime.rete.itc.alg.misc.GraphHelper;
-import tools.refinery.viatra.runtime.base.itc.alg.misc.bfs.BFS;
+import tools.refinery.viatra.runtime.rete.itc.alg.misc.bfs.BFS;
-import tools.refinery.viatra.runtime.base.itc.alg.misc.scc.SCC;
+import tools.refinery.viatra.runtime.rete.itc.alg.misc.scc.SCC;
-import tools.refinery.viatra.runtime.base.itc.graphimpl.Graph;
+import tools.refinery.viatra.runtime.rete.itc.graphimpl.Graph;
 import java.util.Collection;
 import java.util.Set;
diff --git a/subprojects/viatra-runtime/src/main/java/tools/refinery/viatra/runtime/base/itc/alg/representative/WeaklyConnectedComponentAlgorithm.java b/subprojects/viatra-runtime-rete/src/main/java/tools/refinery/viatra/runtime/rete/itc/alg/representative/WeaklyConnectedComponentAlgorithm.java
index 22159499..704f0235 100644
--- a/subprojects/viatra-runtime/src/main/java/tools/refinery/viatra/runtime/base/itc/alg/representative/WeaklyConnectedComponentAlgorithm.java
+++ b/subprojects/viatra-runtime-rete/src/main/java/tools/refinery/viatra/runtime/rete/itc/alg/representative/WeaklyConnectedComponentAlgorithm.java
@@ -3,9 +3,9 @@
 *
 * SPDX-License-Identifier: EPL-2.0
 */
-package tools.refinery.viatra.runtime.base.itc.alg.representative;
+package tools.refinery.viatra.runtime.rete.itc.alg.representative;
-import tools.refinery.viatra.runtime.base.itc.graphimpl.Graph;
+import tools.refinery.viatra.runtime.rete.itc.graphimpl.Graph;
 import java.util.ArrayDeque;
 import java.util.HashSet;
diff --git a/subprojects/viatra-runtime/src/main/java/tools/refinery/viatra/runtime/base/itc/alg/util/CollectionHelper.java b/subprojects/viatra-runtime-rete/src/main/java/tools/refinery/viatra/runtime/rete/itc/alg/util/CollectionHelper.java
index c9b3cafa..6655be6d 100644
--- a/subprojects/viatra-runtime/src/main/java/tools/refinery/viatra/runtime/base/itc/alg/util/CollectionHelper.java
+++ b/subprojects/viatra-runtime-rete/src/main/java/tools/refinery/viatra/runtime/rete/itc/alg/util/CollectionHelper.java
@@ -3,27 +3,27 @@
 * This program and the accompanying materials are made available under the
 * terms of the Eclipse Public License v. 2.0 which is available at
 * http://www.eclipse.org/legal/epl-v20.html.
- * 
+ *
 * SPDX-License-Identifier: EPL-2.0
 *******************************************************************************/
-package tools.refinery.viatra.runtime.base.itc.alg.util;
+package tools.refinery.viatra.runtime.rete.itc.alg.util;
-import java.util.Set;
 import tools.refinery.viatra.runtime.matchers.util.CollectionsFactory;
+import java.util.Set;
 /**
 * @author Tamas Szabo
- * 
+ *
 */
 public class CollectionHelper {
    private CollectionHelper() {/*Utility class constructor*/}
-    
    /**
     * Returns the intersection of two sets. It calls {@link Set#retainAll(java.util.Collection)} but returns a new set
     * containing the elements of the intersection.
-     * 
+     *
     * @param set1
     *            the first set (can be null, interpreted as empty)
     * @param set2
@@ -32,19 +32,19 @@ public class CollectionHelper {
     * @since 1.7
     */
    public static <V> Set<V> intersection(Set<V> set1, Set<V> set2) {
-        if (set1 == null || set2 == null) 
+        if (set1 == null || set2 == null)
            return CollectionsFactory.createSet();
-        
        Set<V> intersection = CollectionsFactory.createSet(set1);
        intersection.retainAll(set2);
        return intersection;
    }
-    
    /**
     * Returns the difference of two sets (S1\S2). It calls {@link Set#removeAll(java.util.Collection)} but returns a
     * new set containing the elements of the difference.
-     * 
+     *
     * @param set1
     *            the first set (can be null, interpreted as empty)
     * @param set2
@@ -55,10 +55,10 @@ public class CollectionHelper {
    public static <V> Set<V> difference(Set<V> set1, Set<V> set2) {
        if (set1 == null)
            return CollectionsFactory.createSet();
-        
        Set<V> difference = CollectionsFactory.createSet(set1);
        if (set2 != null) difference.removeAll(set2);
        return difference;
    }
-    
 }
diff --git a/subprojects/viatra-runtime/src/main/java/tools/refinery/viatra/runtime/base/itc/graphimpl/DotGenerator.java b/subprojects/viatra-runtime-rete/src/main/java/tools/refinery/viatra/runtime/rete/itc/graphimpl/DotGenerator.java
index 0e21f323..f7f6b5ed 100644
--- a/subprojects/viatra-runtime/src/main/java/tools/refinery/viatra/runtime/base/itc/graphimpl/DotGenerator.java
+++ b/subprojects/viatra-runtime-rete/src/main/java/tools/refinery/viatra/runtime/rete/itc/graphimpl/DotGenerator.java
@@ -6,10 +6,10 @@
 *
 * SPDX-License-Identifier: EPL-2.0
 *******************************************************************************/
-package tools.refinery.viatra.runtime.base.itc.graphimpl;
+package tools.refinery.viatra.runtime.rete.itc.graphimpl;
-import tools.refinery.viatra.runtime.base.itc.alg.misc.scc.SCC;
+import tools.refinery.viatra.runtime.rete.itc.alg.misc.scc.SCC;
-import tools.refinery.viatra.runtime.base.itc.alg.misc.scc.SCCResult;
+import tools.refinery.viatra.runtime.rete.itc.alg.misc.scc.SCCResult;
 import tools.refinery.viatra.runtime.matchers.util.IMemoryView;
 import java.util.HashMap;
diff --git a/subprojects/viatra-runtime/src/main/java/tools/refinery/viatra/runtime/base/itc/graphimpl/Graph.java b/subprojects/viatra-runtime-rete/src/main/java/tools/refinery/viatra/runtime/rete/itc/graphimpl/Graph.java
index 4267579c..91604cb2 100644
--- a/subprojects/viatra-runtime/src/main/java/tools/refinery/viatra/runtime/base/itc/graphimpl/Graph.java
+++ b/subprojects/viatra-runtime-rete/src/main/java/tools/refinery/viatra/runtime/rete/itc/graphimpl/Graph.java
@@ -7,11 +7,11 @@
 * SPDX-License-Identifier: EPL-2.0
 *******************************************************************************/
-package tools.refinery.viatra.runtime.base.itc.graphimpl;
+package tools.refinery.viatra.runtime.rete.itc.graphimpl;
-import tools.refinery.viatra.runtime.base.itc.igraph.IGraphDataSource;
+import tools.refinery.viatra.runtime.rete.itc.igraph.IGraphDataSource;
-import tools.refinery.viatra.runtime.base.itc.igraph.IGraphObserver;
+import tools.refinery.viatra.runtime.rete.itc.igraph.IGraphObserver;
-import tools.refinery.viatra.runtime.base.itc.igraph.IBiDirectionalGraphDataSource;
+import tools.refinery.viatra.runtime.rete.itc.igraph.IBiDirectionalGraphDataSource;
 import tools.refinery.viatra.runtime.matchers.util.CollectionsFactory;
 import tools.refinery.viatra.runtime.matchers.util.CollectionsFactory.MemoryType;
 import tools.refinery.viatra.runtime.matchers.util.IMemoryView;
diff --git a/subprojects/viatra-runtime/src/main/java/tools/refinery/viatra/runtime/base/itc/igraph/IBiDirectionalGraphDataSource.java b/subprojects/viatra-runtime-rete/src/main/java/tools/refinery/viatra/runtime/rete/itc/igraph/IBiDirectionalGraphDataSource.java
index 64659447..4fcaa71f 100644
--- a/subprojects/viatra-runtime/src/main/java/tools/refinery/viatra/runtime/base/itc/igraph/IBiDirectionalGraphDataSource.java
+++ b/subprojects/viatra-runtime-rete/src/main/java/tools/refinery/viatra/runtime/rete/itc/igraph/IBiDirectionalGraphDataSource.java
@@ -3,35 +3,35 @@
 * This program and the accompanying materials are made available under the
 * terms of the Eclipse Public License v. 2.0 which is available at
 * http://www.eclipse.org/legal/epl-v20.html.
- * 
+ *
 * SPDX-License-Identifier: EPL-2.0
 *******************************************************************************/
-package tools.refinery.viatra.runtime.base.itc.igraph;
+package tools.refinery.viatra.runtime.rete.itc.igraph;
 import tools.refinery.viatra.runtime.matchers.util.IMemoryView;
 import tools.refinery.viatra.runtime.matchers.util.IMultiset;
 /**
- * A bi-directional graph data source supports all operations that an {@link IGraphDataSource} does, but it 
+ * A bi-directional graph data source supports all operations that an {@link IGraphDataSource} does, but it
- * also makes it possible to query the incoming edges of nodes, not only the outgoing edges. 
+ * also makes it possible to query the incoming edges of nodes, not only the outgoing edges.
- * 
+ *
 * @author Tamas Szabo
- * 
+ *
 * @param <V> the type of the nodes in the graph
 */
 public interface IBiDirectionalGraphDataSource<V> extends IGraphDataSource<V> {
    /**
-     * Returns the source nodes for the given target node.  
+     * Returns the source nodes for the given target node.
     * The returned data structure is an {@link IMultiset} because of potential parallel edges in the graph data source.
-     * 
+     *
     * The method must not return null.
-     * 
+     *
     * @param target the target node
     * @return the multiset of source nodes
     * @since 2.0
     */
    public IMemoryView<V> getSourceNodes(V target);
-    
 }
diff --git a/subprojects/viatra-runtime/src/main/java/tools/refinery/viatra/runtime/base/itc/igraph/IBiDirectionalWrapper.java b/subprojects/viatra-runtime-rete/src/main/java/tools/refinery/viatra/runtime/rete/itc/igraph/IBiDirectionalWrapper.java
index becab0eb..c4315ca2 100644
--- a/subprojects/viatra-runtime/src/main/java/tools/refinery/viatra/runtime/base/itc/igraph/IBiDirectionalWrapper.java
+++ b/subprojects/viatra-runtime-rete/src/main/java/tools/refinery/viatra/runtime/rete/itc/igraph/IBiDirectionalWrapper.java
@@ -3,11 +3,11 @@
 * This program and the accompanying materials are made available under the
 * terms of the Eclipse Public License v. 2.0 which is available at
 * http://www.eclipse.org/legal/epl-v20.html.
- * 
+ *
 * SPDX-License-Identifier: EPL-2.0
 *******************************************************************************/
-package tools.refinery.viatra.runtime.base.itc.igraph;
+package tools.refinery.viatra.runtime.rete.itc.igraph;
 import java.util.Set;
@@ -20,7 +20,7 @@ import tools.refinery.viatra.runtime.matchers.util.IMultiLookup;
 * This class can be used to wrap an {@link IGraphDataSource} into an {@link IBiDirectionalGraphDataSource}. This class
 * provides support for the retrieval of source nodes for a given target which is not supported by standard
 * {@link IGraphDataSource} implementations.
- * 
+ *
 * @author Tamas Szabo
 *
 * @param <V>
diff --git a/subprojects/viatra-runtime/src/main/java/tools/refinery/viatra/runtime/base/itc/igraph/IGraphDataSource.java b/subprojects/viatra-runtime-rete/src/main/java/tools/refinery/viatra/runtime/rete/itc/igraph/IGraphDataSource.java
index 3fa65936..9159a692 100644
--- a/subprojects/viatra-runtime/src/main/java/tools/refinery/viatra/runtime/base/itc/igraph/IGraphDataSource.java
+++ b/subprojects/viatra-runtime-rete/src/main/java/tools/refinery/viatra/runtime/rete/itc/igraph/IGraphDataSource.java
@@ -7,7 +7,7 @@
 * SPDX-License-Identifier: EPL-2.0
 *******************************************************************************/
-package tools.refinery.viatra.runtime.base.itc.igraph;
+package tools.refinery.viatra.runtime.rete.itc.igraph;
 import tools.refinery.viatra.runtime.matchers.util.IMemoryView;
 import tools.refinery.viatra.runtime.matchers.util.IMultiset;
diff --git a/subprojects/viatra-runtime/src/main/java/tools/refinery/viatra/runtime/base/itc/igraph/IGraphObserver.java b/subprojects/viatra-runtime-rete/src/main/java/tools/refinery/viatra/runtime/rete/itc/igraph/IGraphObserver.java
index 5cb2d9fa..a282216d 100644
--- a/subprojects/viatra-runtime/src/main/java/tools/refinery/viatra/runtime/base/itc/igraph/IGraphObserver.java
+++ b/subprojects/viatra-runtime-rete/src/main/java/tools/refinery/viatra/runtime/rete/itc/igraph/IGraphObserver.java
@@ -3,23 +3,23 @@
 * This program and the accompanying materials are made available under the
 * terms of the Eclipse Public License v. 2.0 which is available at
 * http://www.eclipse.org/legal/epl-v20.html.
- * 
+ *
 * SPDX-License-Identifier: EPL-2.0
 *******************************************************************************/
-package tools.refinery.viatra.runtime.base.itc.igraph;
+package tools.refinery.viatra.runtime.rete.itc.igraph;
 /**
 * Interface GraphObserver is used to observ the changes in a graph; edge and node insertion/deleteion.
- * 
+ *
 * @author Tamas Szabo
- * 
+ *
 */
 public interface IGraphObserver<V> {
    /**
     * Used to notify when an edge is inserted into the graph.
-     * 
+     *
     * @param source
     *            the source of the edge
     * @param target
@@ -29,7 +29,7 @@ public interface IGraphObserver<V> {
    /**
     * Used to notify when an edge is deleted from the graph.
-     * 
+     *
     * @param source
     *            the source of the edge
     * @param target
@@ -39,7 +39,7 @@ public interface IGraphObserver<V> {
    /**
     * Used to notify when a node is inserted into the graph.
-     * 
+     *
     * @param n
     *            the node
     */
@@ -47,7 +47,7 @@ public interface IGraphObserver<V> {
    /**
     * Used to notify when a node is deleted from the graph.
-     * 
+     *
     * @param n
     *            the node
     */
diff --git a/subprojects/viatra-runtime/src/main/java/tools/refinery/viatra/runtime/base/itc/igraph/ITcDataSource.java b/subprojects/viatra-runtime-rete/src/main/java/tools/refinery/viatra/runtime/rete/itc/igraph/ITcDataSource.java
index 5924b723..5ede600f 100644
--- a/subprojects/viatra-runtime/src/main/java/tools/refinery/viatra/runtime/base/itc/igraph/ITcDataSource.java
+++ b/subprojects/viatra-runtime-rete/src/main/java/tools/refinery/viatra/runtime/rete/itc/igraph/ITcDataSource.java
@@ -3,21 +3,21 @@
 * This program and the accompanying materials are made available under the
 * terms of the Eclipse Public License v. 2.0 which is available at
 * http://www.eclipse.org/legal/epl-v20.html.
- * 
+ *
 * SPDX-License-Identifier: EPL-2.0
 *******************************************************************************/
-package tools.refinery.viatra.runtime.base.itc.igraph;
+package tools.refinery.viatra.runtime.rete.itc.igraph;
 import java.util.Set;
-import tools.refinery.viatra.runtime.base.itc.alg.misc.IGraphPathFinder;
+import tools.refinery.viatra.runtime.rete.itc.alg.misc.IGraphPathFinder;
 /**
- * This interface defines those methods that a transitive reachability data source should provide. 
+ * This interface defines those methods that a transitive reachability data source should provide.
- * 
+ *
 * @author Tamas Szabo
- * 
+ *
 * @param <V>
 *            the type parameter of the node
 */
@@ -25,7 +25,7 @@ public interface ITcDataSource<V> {
    /**
     * Attach a transitive closure relation observer.
-     * 
+     *
     * @param to
     *            the observer object
     */
@@ -33,7 +33,7 @@ public interface ITcDataSource<V> {
    /**
     * Detach a transitive closure relation observer.
-     * 
+     *
     * @param to
     *            the observer object
     */
@@ -41,7 +41,7 @@ public interface ITcDataSource<V> {
    /**
     * Returns all nodes which are reachable from the source node.
-     * 
+     *
     * @param source
     *            the source node
     * @return the set of target nodes
@@ -50,7 +50,7 @@ public interface ITcDataSource<V> {
    /**
     * Returns all nodes from which the target node is reachable.
-     * 
+     *
     * @param target
     *            the target node
     * @return the set of source nodes
@@ -59,7 +59,7 @@ public interface ITcDataSource<V> {
    /**
     * Returns true if the target node is reachable from the source node.
-     * 
+     *
     * @param source
     *            the source node
     * @param target
@@ -67,14 +67,14 @@ public interface ITcDataSource<V> {
     * @return true if target is reachable from source, false otherwise
     */
    public boolean isReachable(V source, V target);
-    
    /**
     * The returned {@link IGraphPathFinder} can be used to retrieve paths between nodes using transitive reachability.
-     * 
+     *
     * @return a path finder for the graph.
     */
    public IGraphPathFinder<V> getPathFinder();
-    
    /**
     * Call this method to properly dispose the data structures of a transitive closure algorithm.
     */
diff --git a/subprojects/viatra-runtime/src/main/java/tools/refinery/viatra/runtime/base/itc/igraph/ITcObserver.java b/subprojects/viatra-runtime-rete/src/main/java/tools/refinery/viatra/runtime/rete/itc/igraph/ITcObserver.java
index fded53f1..74e0cb75 100644
--- a/subprojects/viatra-runtime/src/main/java/tools/refinery/viatra/runtime/base/itc/igraph/ITcObserver.java
+++ b/subprojects/viatra-runtime-rete/src/main/java/tools/refinery/viatra/runtime/rete/itc/igraph/ITcObserver.java
@@ -3,23 +3,23 @@
 * This program and the accompanying materials are made available under the
 * terms of the Eclipse Public License v. 2.0 which is available at
 * http://www.eclipse.org/legal/epl-v20.html.
- * 
+ *
 * SPDX-License-Identifier: EPL-2.0
 *******************************************************************************/
-package tools.refinery.viatra.runtime.base.itc.igraph;
+package tools.refinery.viatra.runtime.rete.itc.igraph;
 /**
 * Interface ITcObserver is used to observe the changes in a transitive closure relation; tuple insertion/deletion.
- * 
+ *
 * @author Szabo Tamas
- * 
+ *
 */
 public interface ITcObserver<V> {
    /**
     * Used to notify when a tuple is inserted into the transitive closure relation.
-     * 
+     *
     * @param source
     *            the source of the tuple
     * @param target
@@ -29,7 +29,7 @@ public interface ITcObserver<V> {
    /**
     * Used to notify when a tuple is deleted from the transitive closure relation.
-     * 
+     *
     * @param source
     *            the source of the tuple
     * @param target
diff --git a/subprojects/viatra-runtime-rete/src/main/java/tools/refinery/viatra/runtime/rete/network/NodeFactory.java b/subprojects/viatra-runtime-rete/src/main/java/tools/refinery/viatra/runtime/rete/network/NodeFactory.java
index 231bdfe5..3e4ea4e0 100644
--- a/subprojects/viatra-runtime-rete/src/main/java/tools/refinery/viatra/runtime/rete/network/NodeFactory.java
+++ b/subprojects/viatra-runtime-rete/src/main/java/tools/refinery/viatra/runtime/rete/network/NodeFactory.java
@@ -11,9 +11,9 @@ package tools.refinery.viatra.runtime.rete.network;
 import org.apache.log4j.Logger;
 import org.eclipse.emf.common.util.EMap;
-import tools.refinery.viatra.runtime.base.itc.alg.representative.RepresentativeElectionAlgorithm;
+import tools.refinery.viatra.runtime.rete.itc.alg.representative.RepresentativeElectionAlgorithm;
-import tools.refinery.viatra.runtime.base.itc.alg.representative.StronglyConnectedComponentAlgorithm;
+import tools.refinery.viatra.runtime.rete.itc.alg.representative.StronglyConnectedComponentAlgorithm;
-import tools.refinery.viatra.runtime.base.itc.alg.representative.WeaklyConnectedComponentAlgorithm;
+import tools.refinery.viatra.runtime.rete.itc.alg.representative.WeaklyConnectedComponentAlgorithm;
 import tools.refinery.viatra.runtime.matchers.context.IPosetComparator;
 import tools.refinery.viatra.runtime.matchers.psystem.IExpressionEvaluator;
 import tools.refinery.viatra.runtime.matchers.psystem.IRelationEvaluator;
diff --git a/subprojects/viatra-runtime-rete/src/main/java/tools/refinery/viatra/runtime/rete/network/communication/CommunicationTracker.java b/subprojects/viatra-runtime-rete/src/main/java/tools/refinery/viatra/runtime/rete/network/communication/CommunicationTracker.java
index 8435a547..d244e644 100644
--- a/subprojects/viatra-runtime-rete/src/main/java/tools/refinery/viatra/runtime/rete/network/communication/CommunicationTracker.java
+++ b/subprojects/viatra-runtime-rete/src/main/java/tools/refinery/viatra/runtime/rete/network/communication/CommunicationTracker.java
@@ -3,7 +3,7 @@
 * This program and the accompanying materials are made available under the
 * terms of the Eclipse Public License v. 2.0 which is available at
 * http://www.eclipse.org/legal/epl-v20.html.
- * 
+ *
 * SPDX-License-Identifier: EPL-2.0
 *******************************************************************************/
 package tools.refinery.viatra.runtime.rete.network.communication;
@@ -16,9 +16,9 @@ import java.util.PriorityQueue;
 import java.util.Queue;
 import java.util.Set;
-import tools.refinery.viatra.runtime.base.itc.alg.incscc.IncSCCAlg;
+import tools.refinery.viatra.runtime.rete.itc.alg.incscc.IncSCCAlg;
-import tools.refinery.viatra.runtime.base.itc.alg.misc.topsort.TopologicalSorting;
+import tools.refinery.viatra.runtime.rete.itc.alg.misc.topsort.TopologicalSorting;
-import tools.refinery.viatra.runtime.base.itc.graphimpl.Graph;
+import tools.refinery.viatra.runtime.rete.itc.graphimpl.Graph;
 import tools.refinery.viatra.runtime.matchers.tuple.TupleMask;
 import tools.refinery.viatra.runtime.rete.aggregation.IAggregatorNode;
 import tools.refinery.viatra.runtime.rete.boundary.ExternalInputEnumeratorNode;
@@ -52,7 +52,7 @@ import tools.refinery.viatra.runtime.rete.single.TrimmerNode;
 * precisely, the mailboxes that contain the messages) for the associated {@link ReteContainer}. The ordering is
 * governed by the strongly connected components in the dependency network and follows a topological sorting scheme;
 * those mailboxes will be emptied first whose owner nodes do not depend on other undelivered messages.
- * 
+ *
 * @author Tamas Szabo
 * @since 1.6
 *
@@ -186,7 +186,7 @@ public abstract class CommunicationTracker {
                        // or true trimming in its sole parent
                                directParents.size() == 1 && trueTrimming(directParents.iterator().next())))) &&
                        // disallow fallthrough: external updates should be stored (if updates are delayed)
-                                (!(node instanceof ExternalInputEnumeratorNode)) && 
+                                (!(node instanceof ExternalInputEnumeratorNode)) &&
                        // disallow fallthrough: RelationEvaluatorNode needs to be notified in batch-style, and the batching is done by the mailbox
                        // however, it is not the RelationEvaluatorNode itself that is interesting here, as that indirectly uses the BatchingReceiver
                        // so we need to disable fall-through for the BatchingReceiver
@@ -375,7 +375,7 @@ public abstract class CommunicationTracker {
    /**
     * Unregisters a dependency between source and target.
-     * 
+     *
     * @param source
     *            the source node
     * @param target
@@ -416,10 +416,10 @@ public abstract class CommunicationTracker {
    }
    /**
-     * Returns true if the given source-target edge in the communication network acts as a recursion cut point. 
+     * Returns true if the given source-target edge in the communication network acts as a recursion cut point.
     * The current implementation considers edges leading into {@link ProductionNode}s as cut point iff
-     * both source and target belong to the same group. 
+     * both source and target belong to the same group.
-     * 
+     *
     * @param source the source node
     * @param target the target node
     * @return true if the edge is a cut point, false otherwise
diff --git a/subprojects/viatra-runtime-rete/src/main/java/tools/refinery/viatra/runtime/rete/network/communication/timely/TimelyCommunicationTracker.java b/subprojects/viatra-runtime-rete/src/main/java/tools/refinery/viatra/runtime/rete/network/communication/timely/TimelyCommunicationTracker.java
index 1ff69882..79179880 100644
--- a/subprojects/viatra-runtime-rete/src/main/java/tools/refinery/viatra/runtime/rete/network/communication/timely/TimelyCommunicationTracker.java
+++ b/subprojects/viatra-runtime-rete/src/main/java/tools/refinery/viatra/runtime/rete/network/communication/timely/TimelyCommunicationTracker.java
@@ -3,7 +3,7 @@
 * This program and the accompanying materials are made available under the
 * terms of the Eclipse Public License v. 2.0 which is available at
 * http://www.eclipse.org/legal/epl-v20.html.
- * 
+ *
 * SPDX-License-Identifier: EPL-2.0
 *******************************************************************************/
 package tools.refinery.viatra.runtime.rete.network.communication.timely;
@@ -15,8 +15,8 @@ import java.util.Map.Entry;
 import java.util.Set;
 import java.util.function.Function;
-import tools.refinery.viatra.runtime.base.itc.alg.misc.topsort.TopologicalSorting;
+import tools.refinery.viatra.runtime.rete.itc.alg.misc.topsort.TopologicalSorting;
-import tools.refinery.viatra.runtime.base.itc.graphimpl.Graph;
+import tools.refinery.viatra.runtime.rete.itc.graphimpl.Graph;
 import tools.refinery.viatra.runtime.matchers.util.CollectionsFactory;
 import tools.refinery.viatra.runtime.rete.index.IndexerListener;
 import tools.refinery.viatra.runtime.rete.index.SpecializedProjectionIndexer;
@@ -37,7 +37,7 @@ import tools.refinery.viatra.runtime.rete.single.DiscriminatorDispatcherNode;
 /**
 * Timely (DDF) implementation of the {@link CommunicationTracker}.
- * 
+ *
 * @author Tamas Szabo
 * @since 2.3
 */
diff --git a/subprojects/viatra-runtime-rete/src/main/java/tools/refinery/viatra/runtime/rete/single/RepresentativeElectionNode.java b/subprojects/viatra-runtime-rete/src/main/java/tools/refinery/viatra/runtime/rete/single/RepresentativeElectionNode.java
index 6a1e305c..95018c4f 100644
--- a/subprojects/viatra-runtime-rete/src/main/java/tools/refinery/viatra/runtime/rete/single/RepresentativeElectionNode.java
+++ b/subprojects/viatra-runtime-rete/src/main/java/tools/refinery/viatra/runtime/rete/single/RepresentativeElectionNode.java
@@ -8,9 +8,9 @@
 *******************************************************************************/
 package tools.refinery.viatra.runtime.rete.single;
-import tools.refinery.viatra.runtime.base.itc.alg.representative.RepresentativeElectionAlgorithm;
+import tools.refinery.viatra.runtime.rete.itc.alg.representative.RepresentativeElectionAlgorithm;
-import tools.refinery.viatra.runtime.base.itc.alg.representative.RepresentativeObserver;
+import tools.refinery.viatra.runtime.rete.itc.alg.representative.RepresentativeObserver;
-import tools.refinery.viatra.runtime.base.itc.graphimpl.Graph;
+import tools.refinery.viatra.runtime.rete.itc.graphimpl.Graph;
 import tools.refinery.viatra.runtime.matchers.tuple.Tuple;
 import tools.refinery.viatra.runtime.matchers.tuple.Tuples;
 import tools.refinery.viatra.runtime.matchers.util.Clearable;
diff --git a/subprojects/viatra-runtime-rete/src/main/java/tools/refinery/viatra/runtime/rete/single/TransitiveClosureNode.java b/subprojects/viatra-runtime-rete/src/main/java/tools/refinery/viatra/runtime/rete/single/TransitiveClosureNode.java
index eeead31b..fdda4ef4 100644
--- a/subprojects/viatra-runtime-rete/src/main/java/tools/refinery/viatra/runtime/rete/single/TransitiveClosureNode.java
+++ b/subprojects/viatra-runtime-rete/src/main/java/tools/refinery/viatra/runtime/rete/single/TransitiveClosureNode.java
@@ -8,11 +8,11 @@
 *******************************************************************************/
 package tools.refinery.viatra.runtime.rete.single;
-import tools.refinery.viatra.runtime.base.itc.alg.incscc.IncSCCAlg;
+import tools.refinery.viatra.runtime.rete.itc.alg.incscc.IncSCCAlg;
-import tools.refinery.viatra.runtime.base.itc.alg.misc.Tuple;
+import tools.refinery.viatra.runtime.rete.itc.alg.misc.Tuple;
-import tools.refinery.viatra.runtime.base.itc.graphimpl.Graph;
+import tools.refinery.viatra.runtime.rete.itc.graphimpl.Graph;
-import tools.refinery.viatra.runtime.base.itc.igraph.ITcDataSource;
+import tools.refinery.viatra.runtime.rete.itc.igraph.ITcDataSource;
-import tools.refinery.viatra.runtime.base.itc.igraph.ITcObserver;
+import tools.refinery.viatra.runtime.rete.itc.igraph.ITcObserver;
 import tools.refinery.viatra.runtime.matchers.tuple.Tuples;
 import tools.refinery.viatra.runtime.matchers.util.Clearable;
 import tools.refinery.viatra.runtime.matchers.util.Direction;
diff --git a/subprojects/viatra-runtime/src/main/java/tools/refinery/viatra/runtime/base/itc/alg/dred/DRedAlg.java b/subprojects/viatra-runtime/src/main/java/tools/refinery/viatra/runtime/base/itc/alg/dred/DRedAlg.java
deleted file mode 100644
index b92d08bf..00000000
--- a/subprojects/viatra-runtime/src/main/java/tools/refinery/viatra/runtime/base/itc/alg/dred/DRedAlg.java
+++ /dev/null
@@ -1,308 +0,0 @@
-/*******************************************************************************
- * Copyright (c) 2010-2012, Tamas Szabo, Istvan Rath and Daniel Varro
- * This program and the accompanying materials are made available under the
- * terms of the Eclipse Public License v. 2.0 which is available at
- * http://www.eclipse.org/legal/epl-v20.html.
- * 
- * SPDX-License-Identifier: EPL-2.0
- *******************************************************************************/
-package tools.refinery.viatra.runtime.base.itc.alg.dred;
-import java.util.ArrayList;
-import java.util.HashMap;
-import java.util.HashSet;
-import java.util.List;
-import java.util.Map;
-import java.util.Map.Entry;
-import java.util.Set;
-import tools.refinery.viatra.runtime.base.itc.alg.misc.DFSPathFinder;
-import tools.refinery.viatra.runtime.base.itc.alg.misc.IGraphPathFinder;
-import tools.refinery.viatra.runtime.base.itc.alg.misc.Tuple;
-import tools.refinery.viatra.runtime.base.itc.alg.misc.dfs.DFSAlg;
-import tools.refinery.viatra.runtime.base.itc.igraph.IGraphDataSource;
-import tools.refinery.viatra.runtime.base.itc.igraph.IGraphObserver;
-import tools.refinery.viatra.runtime.base.itc.igraph.ITcDataSource;
-import tools.refinery.viatra.runtime.base.itc.igraph.ITcObserver;
-import tools.refinery.viatra.runtime.matchers.util.IMemoryView;
-/**
- * This class is the optimized implementation of the DRED algorithm.
- * 
- * @author Tamas Szabo
- * 
- * @param <V>
- *            the type parameter of the nodes in the graph data source
- */
-public class DRedAlg<V> implements IGraphObserver<V>, ITcDataSource<V> {
-    private IGraphDataSource<V> graphDataSource = null;
-    private DRedTcRelation<V> tc = null;
-    private DRedTcRelation<V> dtc = null;
-    private List<ITcObserver<V>> observers;
-    /**
-     * Constructs a new DRED algorithm and initializes the transitive closure relation with the given graph data source.
-     * Attach itself on the graph data source as an observer.
-     * 
-     * @param gds
-     *            the graph data source instance
-     */
-    public DRedAlg(IGraphDataSource<V> gds) {
-        this.observers = new ArrayList<ITcObserver<V>>();
-        this.graphDataSource = gds;
-        this.tc = new DRedTcRelation<V>();
-        this.dtc = new DRedTcRelation<V>();
-        initTc();
-        graphDataSource.attachObserver(this);
-    }
-    /**
-     * Constructs a new DRED algorithm and initializes the transitive closure relation with the given relation. Attach
-     * itself on the graph data source as an observer.
-     * 
-     * @param gds
-     *            the graph data source instance
-     * @param tc
-     *            the transitive closure instance
-     */
-    public DRedAlg(IGraphDataSource<V> gds, DRedTcRelation<V> tc) {
-        this.graphDataSource = gds;
-        this.tc = tc;
-        this.dtc = new DRedTcRelation<V>();
-        graphDataSource.attachObserver(this);
-    }
-    /**
-     * Initializes the transitive closure relation.
-     */
-    private void initTc() {
-        DFSAlg<V> dfsa = new DFSAlg<V>(this.graphDataSource);
-        this.setTcRelation(dfsa.getTcRelation());
-        this.graphDataSource.detachObserver(dfsa);
-    }
-    @Override
-    public void edgeInserted(V source, V target) {
-        if (!source.equals(target)) {
-            Set<V> tupStarts = null;
-            Set<V> tupEnds = null;
-            Set<Tuple<V>> tuples = new HashSet<Tuple<V>>();
-            if (!source.equals(target) && tc.addTuple(source, target)) {
-                tuples.add(new Tuple<V>(source, target));
-            }
-            // 2. d+(tc(x,y)) :- d+(tc(x,z)) & lv(z,y) Descartes product
-            tupStarts = tc.getTupleStarts(source);
-            tupEnds = tc.getTupleEnds(target);
-            for (V s : tupStarts) {
-                for (V t : tupEnds) {
-                    if (!s.equals(t) && tc.addTuple(s, t)) {
-                        tuples.add(new Tuple<V>(s, t));
-                    }
-                }
-            }
-            // (s, source) -> (source, target)
-            // tupStarts = tc.getTupleStarts(source);
-            for (V s : tupStarts) {
-                if (!s.equals(target) && tc.addTuple(s, target)) {
-                    tuples.add(new Tuple<V>(s, target));
-                }
-            }
-            // (source, target) -> (target, t)
-            // tupEnds = tc.getTupleEnds(target);
-            for (V t : tupEnds) {
-                if (!source.equals(t) && tc.addTuple(source, t)) {
-                    tuples.add(new Tuple<V>(source, t));
-                }
-            }
-            notifyTcObservers(tuples, 1);
-        }
-    }
-    @Override
-    public void edgeDeleted(V source, V target) {
-        if (!source.equals(target)) {
-            // Computing overestimate, Descartes product of A and B sets, where
-            // A: those nodes from which source is reachable
-            // B: those nodes which is reachable from target
-            Map<Tuple<V>, Integer> tuples = new HashMap<Tuple<V>, Integer>();
-            Set<V> sources = tc.getTupleStarts(source);
-            Set<V> targets = tc.getTupleEnds(target);
-            tc.removeTuple(source, target);
-            tuples.put(new Tuple<V>(source, target), -1);
-            for (V s : sources) {
-                for (V t : targets) {
-                    if (!s.equals(t)) {
-                        tc.removeTuple(s, t);
-                        tuples.put(new Tuple<V>(s, t), -1);
-                    }
-                }
-            }
-            for (V s : sources) {
-                if (!s.equals(target)) {
-                    tc.removeTuple(s, target);
-                    tuples.put(new Tuple<V>(s, target), -1);
-                }
-            }
-            for (V t : targets) {
-                if (!source.equals(t)) {
-                    tc.removeTuple(source, t);
-                    tuples.put(new Tuple<V>(source, t), -1);
-                }
-            }
-            // System.out.println("overestimate: "+dtc);
-            // Modify overestimate with those tuples that have alternative derivations
-            // 1. q+(tc(x,y)) :- lv(x,y)
-            for (V s : graphDataSource.getAllNodes()) {
-                IMemoryView<V> targetNodes = graphDataSource.getTargetNodes(s);
-                for (Entry<V, Integer> entry : targetNodes.entriesWithMultiplicities()) {
-                    for (int i = 0; i < entry.getValue(); i++) {
-                        V t = entry.getKey();
-                        if (!s.equals(t)) {
-                            tc.addTuple(s, t);
-                            Tuple<V> tuple = new Tuple<V>(s, t);
-                            Integer count = tuples.get(tuple);
-                            if (count != null && count == -1) {
-                                tuples.remove(tuple);
-                            }
-                        }
-                        
-                    }
-                }
-            }
-            // 2. q+(tc(x,y)) :- tcv(x,z) & lv(z,y)
-            DRedTcRelation<V> newTups = new DRedTcRelation<V>();
-            dtc.clear();
-            dtc.union(tc);
-            while (!dtc.isEmpty()) {
-                newTups.clear();
-                newTups.union(dtc);
-                dtc.clear();
-                for (V s : newTups.getTupleStarts()) {
-                    for (V t : newTups.getTupleEnds(s)) {
-                        IMemoryView<V> targetNodes = graphDataSource.getTargetNodes(t);
-                        if (targetNodes != null) {
-                            for (Entry<V, Integer> entry : targetNodes.entriesWithMultiplicities()) {
-                                for (int i = 0; i < entry.getValue(); i++) {
-                                    V tn = entry.getKey();
-                                    if (!s.equals(tn) && tc.addTuple(s, tn)) {
-                                        dtc.addTuple(s, tn);
-                                        tuples.remove(new Tuple<V>(s, tn));
-                                    }
-                                }
-                            }
-                        }
-                    }
-                }
-            }
-            notifyTcObservers(tuples.keySet(), -1);
-        }
-    }
-    @Override
-    public void nodeInserted(V n) {
-        // Node inserted does not result new tc tuple.
-    }
-    @Override
-    public void nodeDeleted(V n) {
-        // FIXME node deletion may involve the deletion of incoming and outgoing edges too
-        Set<V> set = tc.getTupleEnds(n);
-        Set<V> modSet = null;
-        // n -> target
-        modSet = new HashSet<V>(set);
-        for (V tn : modSet) {
-            this.tc.removeTuple(n, tn);
-        }
-        // source -> n
-        set = tc.getTupleStarts(n);
-        modSet = new HashSet<V>(set);
-        for (V sn : modSet) {
-            this.tc.removeTuple(sn, n);
-        }
-    }
-    public DRedTcRelation<V> getTcRelation() {
-        return this.tc;
-    }
-    public void setTcRelation(DRedTcRelation<V> tc) {
-        this.tc = tc;
-    }
-    @Override
-    public boolean isReachable(V source, V target) {
-        return tc.containsTuple(source, target);
-    }
-    @Override
-    public void attachObserver(ITcObserver<V> to) {
-        this.observers.add(to);
-    }
-    @Override
-    public void detachObserver(ITcObserver<V> to) {
-        this.observers.remove(to);
-    }
-    @Override
-    public Set<V> getAllReachableTargets(V source) {
-        return tc.getTupleEnds(source);
-    }
-    @Override
-    public Set<V> getAllReachableSources(V target) {
-        return tc.getTupleStarts(target);
-    }
-    protected void notifyTcObservers(Set<Tuple<V>> tuples, int dir) {
-        for (ITcObserver<V> o : observers) {
-            for (Tuple<V> t : tuples) {
-                if (!t.getSource().equals(t.getTarget())) {
-                    if (dir == 1) {
-                        o.tupleInserted(t.getSource(), t.getTarget());
-                    }
-                    if (dir == -1) {
-                        o.tupleDeleted(t.getSource(), t.getTarget());
-                    }
-                }
-            }
-        }
-    }
-    @Override
-    public void dispose() {
-        tc = null;
-        dtc = null;
-    }
-    @Override
-    public IGraphPathFinder<V> getPathFinder() {
-        return new DFSPathFinder<V>(graphDataSource, this);
-    }
-}
diff --git a/subprojects/viatra-runtime/src/main/java/tools/refinery/viatra/runtime/base/itc/alg/dred/DRedTcRelation.java b/subprojects/viatra-runtime/src/main/java/tools/refinery/viatra/runtime/base/itc/alg/dred/DRedTcRelation.java
deleted file mode 100644
index 8543b79c..00000000
--- a/subprojects/viatra-runtime/src/main/java/tools/refinery/viatra/runtime/base/itc/alg/dred/DRedTcRelation.java
+++ /dev/null
@@ -1,223 +0,0 @@
-/*******************************************************************************
- * Copyright (c) 2010-2012, Tamas Szabo, Istvan Rath and Daniel Varro
- * This program and the accompanying materials are made available under the
- * terms of the Eclipse Public License v. 2.0 which is available at
- * http://www.eclipse.org/legal/epl-v20.html.
- * 
- * SPDX-License-Identifier: EPL-2.0
- *******************************************************************************/
-package tools.refinery.viatra.runtime.base.itc.alg.dred;
-import java.util.HashMap;
-import java.util.HashSet;
-import java.util.Map;
-import java.util.Map.Entry;
-import java.util.Set;
-import tools.refinery.viatra.runtime.base.itc.alg.misc.ITcRelation;
-public class DRedTcRelation<V> implements ITcRelation<V> {
-    // tc(a,b) means that b is transitively reachable from a
-    private Map<V, Set<V>> tuplesForward;
-    // data structure to efficiently get those nodes from which a given node is reachable
-    // symmetric to tuplesForward
-    private Map<V, Set<V>> tuplesBackward;
-    public DRedTcRelation() {
-        this.tuplesForward = new HashMap<V, Set<V>>();
-        this.tuplesBackward = new HashMap<V, Set<V>>();
-    }
-    public void clear() {
-        this.tuplesForward.clear();
-        this.tuplesBackward.clear();
-    }
-    public boolean isEmpty() {
-        return tuplesForward.isEmpty();
-    }
-    public void removeTuple(V source, V target) {
-        // removing tuple from 'forward' tc relation
-        Set<V> sSet = tuplesForward.get(source);
-        if (sSet != null) {
-            sSet.remove(target);
-            if (sSet.size() == 0)
-                tuplesForward.remove(source);
-        }
-        // removing tuple from 'backward' tc relation
-        Set<V> tSet = tuplesBackward.get(target);
-        if (tSet != null) {
-            tSet.remove(source);
-            if (tSet.size() == 0)
-                tuplesBackward.remove(target);
-        }
-    }
-    /**
-     * Returns true if the tc relation did not contain previously such a tuple that is defined by (source,target), false
-     * otherwise.
-     * 
-     * @param source
-     *            the source of the tuple
-     * @param target
-     *            the target of the tuple
-     * @return true if the relation did not contain previously the tuple
-     */
-    public boolean addTuple(V source, V target) {
-        // symmetric modification, it is sufficient to check the return value in one collection
-        // adding tuple to 'forward' tc relation
-        Set<V> sSet = tuplesForward.get(source);
-        if (sSet == null) {
-            Set<V> newSet = new HashSet<V>();
-            newSet.add(target);
-            tuplesForward.put(source, newSet);
-        } else {
-            sSet.add(target);
-        }
-        // adding tuple to 'backward' tc relation
-        Set<V> tSet = tuplesBackward.get(target);
-        if (tSet == null) {
-            Set<V> newSet = new HashSet<V>();
-            newSet.add(source);
-            tuplesBackward.put(target, newSet);
-            return true;
-        } else {
-            boolean ret = tSet.add(source);
-            return ret;
-        }
-    }
-    /**
-     * Union operation of two tc realtions.
-     * 
-     * @param rA
-     *            the other tc relation
-     */
-    public void union(DRedTcRelation<V> rA) {
-        for (V source : rA.tuplesForward.keySet()) {
-            for (V target : rA.tuplesForward.get(source)) {
-                this.addTuple(source, target);
-            }
-        }
-    }
-    /**
-     * Computes the difference of this tc relation and the given rA parameter.
-     * 
-     * @param rA
-     *            the subtrahend relation
-     */
-    public void difference(DRedTcRelation<V> rA) {
-        for (V source : rA.tuplesForward.keySet()) {
-            for (V target : rA.tuplesForward.get(source)) {
-                this.removeTuple(source, target);
-            }
-        }
-    }
-    @Override
-    public Set<V> getTupleEnds(V source) {
-        Set<V> t = tuplesForward.get(source);
-        return (t == null) ? new HashSet<V>() : new HashSet<V>(t);
-    }
-    /**
-     * Returns the set of nodes from which the target node is reachable.
-     * 
-     * @param target
-     *            the target node
-     * @return the set of source nodes
-     */
-    public Set<V> getTupleStarts(V target) {
-        Set<V> t = tuplesBackward.get(target);
-        return (t == null) ? new HashSet<V>() : new HashSet<V>(t);
-    }
-    @Override
-    public Set<V> getTupleStarts() {
-        Set<V> t = tuplesForward.keySet();
-        return new HashSet<V>(t);
-    }
-    @Override
-    public String toString() {
-        StringBuilder sb = new StringBuilder("TcRelation = ");
-        for (Entry<V, Set<V>> entry : this.tuplesForward.entrySet()) {
-            V source = entry.getKey();
-            for (V target : entry.getValue()) {
-                sb.append("(" + source + "," + target + ") ");
-            }
-        }
-        return sb.toString();
-    }
-    /**
-     * Returns true if a (source, target) node is present in the transitive closure relation, false otherwise.
-     * 
-     * @param source
-     *            the source node
-     * @param target
-     *            the target node
-     * @return true if tuple is present, false otherwise
-     */
-    public boolean containsTuple(V source, V target) {
-        if (tuplesForward.containsKey(source)) {
-            if (tuplesForward.get(source).contains(target))
-                return true;
-        }
-        return false;
-    }
-    @SuppressWarnings("unchecked")
-    @Override
-    public boolean equals(Object obj) {
-        if (this == obj) {
-            return true;
-        }
-        if ((obj == null) || (obj.getClass() != this.getClass())) {
-            return false;
-        }
-        DRedTcRelation<V> aTR = (DRedTcRelation<V>) obj;
-        for (Entry<V, Set<V>> entry : aTR.tuplesForward.entrySet()) {
-            V source = entry.getKey();
-            for (V target : entry.getValue()) {
-                if (!this.containsTuple(source, target))
-                    return false;
-            }
-        }
-        for (Entry<V, Set<V>> entry : this.tuplesForward.entrySet()) {
-            V source = entry.getKey();
-            for (V target : entry.getValue()) {
-                if (!aTR.containsTuple(source, target))
-                    return false;
-            }
-        }
-        return true;
-    }
-    @Override
-    public int hashCode() {
-        int hash = 7;
-        hash = 31 * hash + tuplesForward.hashCode();
-        hash = 31 * hash + tuplesBackward.hashCode();
-        return hash;
-    }
-    public Map<V, Set<V>> getTuplesForward() {
-        return tuplesForward;
-    }
-}
diff --git a/subprojects/viatra-runtime/src/main/java/tools/refinery/viatra/runtime/base/itc/alg/fw/FloydWarshallAlg.java b/subprojects/viatra-runtime/src/main/java/tools/refinery/viatra/runtime/base/itc/alg/fw/FloydWarshallAlg.java
deleted file mode 100644
index 8b8908b1..00000000
--- a/subprojects/viatra-runtime/src/main/java/tools/refinery/viatra/runtime/base/itc/alg/fw/FloydWarshallAlg.java
+++ /dev/null
@@ -1,110 +0,0 @@
-/*******************************************************************************
- * Copyright (c) 2010-2012, Tamas Szabo, Istvan Rath and Daniel Varro
- * This program and the accompanying materials are made available under the
- * terms of the Eclipse Public License v. 2.0 which is available at
- * http://www.eclipse.org/legal/epl-v20.html.
- *
- * SPDX-License-Identifier: EPL-2.0
- *******************************************************************************/
-package tools.refinery.viatra.runtime.base.itc.alg.fw;
-import java.util.HashMap;
-import java.util.Map;
-import tools.refinery.viatra.runtime.base.itc.alg.dred.DRedTcRelation;
-import tools.refinery.viatra.runtime.base.itc.igraph.IGraphDataSource;
-import tools.refinery.viatra.runtime.base.itc.igraph.IGraphObserver;
-import tools.refinery.viatra.runtime.base.itc.igraph.IBiDirectionalGraphDataSource;
-import tools.refinery.viatra.runtime.base.itc.igraph.IBiDirectionalWrapper;
-import tools.refinery.viatra.runtime.matchers.util.IMemoryView;
-public class FloydWarshallAlg<V> implements IGraphObserver<V> {
-    private DRedTcRelation<V> tc = null;
-    private IBiDirectionalGraphDataSource<V> gds = null;
-    public FloydWarshallAlg(IGraphDataSource<V> gds) {
-        if (gds instanceof IBiDirectionalGraphDataSource<?>) {
-            this.gds = (IBiDirectionalGraphDataSource<V>) gds;
-        } else {
-            this.gds = new IBiDirectionalWrapper<V>(gds);
-        }
-        this.tc = new DRedTcRelation<V>();
-        gds.attachObserver(this);
-        generateTc();
-    }
-    private void generateTc() {
-        tc.clear();
-        int n = gds.getAllNodes().size();
-        Map<V, Integer> mapForw = new HashMap<V, Integer>();
-        Map<Integer, V> mapBackw = new HashMap<Integer, V>();
-        int[][] P = new int[n][n];
-        int i, j, k;
-        // initialize adjacent matrix
-        for (i = 0; i < n; i++) {
-            for (j = 0; j < n; j++) {
-                P[i][j] = 0;
-            }
-        }
-        i = 0;
-        for (V node : gds.getAllNodes()) {
-            mapForw.put(node, i);
-            mapBackw.put(i, node);
-            i++;
-        }
-        for (V source : gds.getAllNodes()) {
-            IMemoryView<V> targets = gds.getTargetNodes(source);
-            for (V target : targets.distinctValues()) {
-                P[mapForw.get(source)][mapForw.get(target)] = 1;
-            }
-        }
-        for (k = 0; k < n; k++) {
-            for (i = 0; i < n; i++) {
-                for (j = 0; j < n; j++) {
-                    P[i][j] = P[i][j] | (P[i][k] & P[k][j]);
-                }
-            }
-        }
-        for (i = 0; i < n; i++) {
-            for (j = 0; j < n; j++) {
-                if (P[i][j] == 1 && i != j)
-                    tc.addTuple(mapBackw.get(i), mapBackw.get(j));
-            }
-        }
-    }
-    @Override
-    public void edgeInserted(V source, V target) {
-        generateTc();
-    }
-    @Override
-    public void edgeDeleted(V source, V target) {
-        generateTc();
-    }
-    @Override
-    public void nodeInserted(V n) {
-        generateTc();
-    }
-    @Override
-    public void nodeDeleted(V n) {
-        generateTc();
-    }
-    public DRedTcRelation<V> getTcRelation() {
-        return this.tc;
-    }
-}
diff --git a/subprojects/viatra-runtime/src/main/java/tools/refinery/viatra/runtime/base/itc/alg/misc/dfs/DFSAlg.java b/subprojects/viatra-runtime/src/main/java/tools/refinery/viatra/runtime/base/itc/alg/misc/dfs/DFSAlg.java
deleted file mode 100644
index c8d25c4e..00000000
--- a/subprojects/viatra-runtime/src/main/java/tools/refinery/viatra/runtime/base/itc/alg/misc/dfs/DFSAlg.java
+++ /dev/null
@@ -1,93 +0,0 @@
-/*******************************************************************************
- * Copyright (c) 2010-2012, Tamas Szabo, Istvan Rath and Daniel Varro
- * This program and the accompanying materials are made available under the
- * terms of the Eclipse Public License v. 2.0 which is available at
- * http://www.eclipse.org/legal/epl-v20.html.
- * 
- * SPDX-License-Identifier: EPL-2.0
- *******************************************************************************/
-package tools.refinery.viatra.runtime.base.itc.alg.misc.dfs;
-import java.util.HashMap;
-import tools.refinery.viatra.runtime.base.itc.alg.dred.DRedTcRelation;
-import tools.refinery.viatra.runtime.base.itc.igraph.IGraphDataSource;
-import tools.refinery.viatra.runtime.base.itc.igraph.IGraphObserver;
-public class DFSAlg<V> implements IGraphObserver<V> {
-    private IGraphDataSource<V> gds;
-    private DRedTcRelation<V> tc;
-    private int[] visited;
-    private HashMap<V, Integer> nodeMap;
-    public DFSAlg(IGraphDataSource<V> gds) {
-        this.gds = gds;
-        this.tc = new DRedTcRelation<V>();
-        gds.attachObserver(this);
-        deriveTc();
-    }
-    private void deriveTc() {
-        tc.clear();
-        this.visited = new int[gds.getAllNodes().size()];
-        nodeMap = new HashMap<V, Integer>();
-        int j = 0;
-        for (V n : gds.getAllNodes()) {
-            nodeMap.put(n, j);
-            j++;
-        }
-        for (V n : gds.getAllNodes()) {
-            oneDFS(n, n);
-            initVisitedArray();
-        }
-    }
-    private void initVisitedArray() {
-        for (int i = 0; i < visited.length; i++)
-            visited[i] = 0;
-    }
-    private void oneDFS(V act, V source) {
-        if (!act.equals(source)) {
-            tc.addTuple(source, act);
-        }
-        visited[nodeMap.get(act)] = 1;
-        for (V t : gds.getTargetNodes(act).distinctValues()) {
-            if (visited[nodeMap.get(t)] == 0) {
-                oneDFS(t, source);
-            }
-        }
-    }
-    public DRedTcRelation<V> getTcRelation() {
-        return this.tc;
-    }
-    @Override
-    public void edgeInserted(V source, V target) {
-        deriveTc();
-    }
-    @Override
-    public void edgeDeleted(V source, V target) {
-        deriveTc();
-    }
-    @Override
-    public void nodeInserted(V n) {
-        deriveTc();
-    }
-    @Override
-    public void nodeDeleted(V n) {
-        deriveTc();
-    }
-}
author	Kristóf Marussy <kristof@marussy.com>	2023-08-19 03:56:39 +0200
committer	Kristóf Marussy <kristof@marussy.com>	2023-08-19 03:56:39 +0200
commit	6e11ebab0aa0dca1de5475761978073dd849aa36 (patch)
tree	a96f4caa74a10e799506fceae848b667de2e2d19
parent	refactor: apply local search fixes to VIATRA (diff)
download	refinery-6e11ebab0aa0dca1de5475761978073dd849aa36.tar.gz refinery-6e11ebab0aa0dca1de5475761978073dd849aa36.tar.zst refinery-6e11ebab0aa0dca1de5475761978073dd849aa36.zip