From 17bd9beaf7f358a44e5bf36a5855fe6727d506dc Mon Sep 17 00:00:00 2001
From: Federico Igne <federico.igne@cs.ox.ac.uk>
Date: Tue, 10 May 2022 18:17:06 +0100
Subject: [pagoda] Move project to Scala

This commit includes a few changes:
- The repository still uses Maven to manage dependency but it is now a
  Scala project.
- The code has been ported from OWLAPI 3.4.10 to 5.1.20
- A proof of concept program using both RSAComb and PAGOdA has been
  added.
---
 .../ox/cs/pagoda/util/data_structures/Graph.java   | 38 ----------------------
 1 file changed, 38 deletions(-)
 delete mode 100644 src/uk/ac/ox/cs/pagoda/util/data_structures/Graph.java

(limited to 'src/uk/ac/ox/cs/pagoda/util/data_structures')

diff --git a/src/uk/ac/ox/cs/pagoda/util/data_structures/Graph.java b/src/uk/ac/ox/cs/pagoda/util/data_structures/Graph.java
deleted file mode 100644
index 4f454df..0000000
--- a/src/uk/ac/ox/cs/pagoda/util/data_structures/Graph.java
+++ /dev/null
@@ -1,38 +0,0 @@
-package uk.ac.ox.cs.pagoda.util.data_structures;
-
-import java.util.*;
-
-public class Graph<V> {
-
-    private final boolean isDirected;
-
-    private Map<V, Set<V>> outEdgesOf = new HashMap<>();
-    public Graph(boolean isDirected) {
-        this.isDirected = isDirected;
-    }
-
-    public Graph() {
-        this(false);
-    }
-    public void addNode(V v) {
-        if(!outEdgesOf.containsKey(v))
-            outEdgesOf.put(v, new HashSet<V>());
-    }
-
-    public void addEdge(V v, V u) {
-        addNode(v);
-        addNode(u);
-        outEdgesOf.get(v).add(u);
-
-        if(isDirected)
-            outEdgesOf.get(u).add(v);
-    }
-
-    public Iterator<V> getOutNeighbors(V v) {
-        return outEdgesOf.get(v).iterator();
-    }
-
-    public boolean isDirected() {
-        return isDirected;
-    }
-}
-- 
cgit v1.2.3