1 files changed, 0 insertions, 146 deletions

diff --git a/subprojects/viatra-runtime/src/main/java/tools/refinery/viatra/runtime/base/itc/alg/misc/scc/SCC.java b/subprojects/viatra-runtime/src/main/java/tools/refinery/viatra/runtime/base/itc/alg/misc/scc/SCC.java
deleted file mode 100644
index 8915998b..00000000
--- a/subprojects/viatra-runtime/src/main/java/tools/refinery/viatra/runtime/base/itc/alg/misc/scc/SCC.java
+++ /dev/null
@@ -1,146 +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.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.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
-     */
-    public static <V> SCCResult<V> computeSCC(IGraphDataSource<V> g) {
-        int index = 0;
-        Set<Set<V>> ret = new HashSet<Set<V>>();
-
-        // stores the lowlink and index information for the given node
-        Map<V, SCCProperty> nodeMap = CollectionsFactory.createMap();
-
-        // stores all target nodes of a given node - the list will be modified
-        Map<V, Set<V>> targetNodeMap = CollectionsFactory.createMap();
-
-        // stores those target nodes for a given node which have not been visited
-        Map<V, Set<V>> notVisitedMap = CollectionsFactory.createMap();
-
-        // stores the nodes during the traversal
-        Stack<V> nodeStack = new Stack<V>();
-
-        // stores the nodes which belong to an scc (there can be many sccs in the stack at the same time)
-        Stack<V> sccStack = new Stack<V>();
-
-        boolean sink = false, finishedTraversal = true;
-
-        // initialize all nodes with 0 index and 0 lowlink
-        Set<V> allNodes = g.getAllNodes();
-        for (V n : allNodes) {
-            nodeMap.put(n, new SCCProperty(0, 0));
-        }
-
-        for (V n : allNodes) {
-            // if the node has not been visited yet
-            if (nodeMap.get(n).getIndex() == 0) {
-                nodeStack.push(n);
-
-                while (!nodeStack.isEmpty()) {
-                    V currentNode = nodeStack.peek();
-                    sink = false;
-                    finishedTraversal = false;
-                    SCCProperty prop = nodeMap.get(currentNode);
-
-                    if (nodeMap.get(currentNode).getIndex() == 0) {
-                        index++;
-                        sccStack.push(currentNode);
-                        prop.setIndex(index);
-                        prop.setLowlink(index);
-
-                        notVisitedMap.put(currentNode, new HashSet<V>());
-
-                        // storing the target nodes of the actual node
-                        if (g.getTargetNodes(currentNode) != null) {
-                            Set<V> targets = g.getTargetNodes(currentNode).distinctValues();
-                            targetNodeMap.put(currentNode, CollectionsFactory.createSet(targets));
-                        }
-                    }
-
-                    if (targetNodeMap.get(currentNode) != null) {
-
-                        // remove node from stack, the exploration of its children has finished
-                        if (targetNodeMap.get(currentNode).size() == 0) {
-                            targetNodeMap.remove(currentNode);
-
-                            nodeStack.pop();
-
-                            for (V targetNode : g.getTargetNodes(currentNode).distinctValues()) {
-                                if (notVisitedMap.get(currentNode).contains(targetNode)) {
-                                    prop.setLowlink(Math.min(prop.getLowlink(), nodeMap.get(targetNode).getLowlink()));
-                                } else if (sccStack.contains(targetNode)) {
-                                    prop.setLowlink(Math.min(prop.getLowlink(), nodeMap.get(targetNode).getIndex()));
-                                }
-                            }
-
-                            finishedTraversal = true;
-                        } else {
-                            V targetNode = targetNodeMap.get(currentNode).iterator().next();
-                            targetNodeMap.get(currentNode).remove(targetNode);
-                            // if the targetNode has not yet been visited push it to the stack
-                            // and mark it in the notVisitedMap
-                            if (nodeMap.get(targetNode).getIndex() == 0) {
-                                notVisitedMap.get(currentNode).add(targetNode);
-                                nodeStack.add(targetNode);
-                            }
-                        }
-                    }
-                    // if currentNode has no target nodes
-                    else {
-                        nodeStack.pop();
-                        sink = true;
-                    }
-
-                    // create scc if node is a sink or an scc has been found
-                    if ((sink || finishedTraversal) && (prop.getLowlink() == prop.getIndex())) {
-                        Set<V> sc = new HashSet<V>();
-                        V targetNode = null;
-
-                        do {
-                            targetNode = sccStack.pop();
-                            sc.add(targetNode);
-                        } while (!targetNode.equals(currentNode));
-
-                        ret.add(sc);
-                    }
-                }
-            }
-        }
-
-        return new SCCResult<V>(ret, g);
-    }
-}