Add copy constructors for graph and neighborlist

Author: tdebatty

src/main/java/info/debatty/java/graphs/Graph.java

@@ -88,6 +88,23 @@ public class Graph<T> implements Serializable {
     private int window_size = 0;
     private int current_sequence = 0;
 
+    /**
+     * Copy constructor.
+     *
+     * @param origin
+     */
+    public Graph(Graph<T> origin) {
+        this.k = origin.k;
+        this.window_size = origin.window_size;
+        this.current_sequence = origin.current_sequence;
+        this.similarity = origin.similarity;
+        this.map = new HashMap<Node<T>, NeighborList>(origin.size());
+
+        for (Node node : origin.getNodes()) {
+            this.map.put(node, new NeighborList(origin.get(node)));
+        }
+    }
+
     /**
      * Initialize an empty graph, and set k (number of edges per node).
      * Default k is 10.

src/main/java/info/debatty/java/graphs/NeighborList.java

@@ -28,6 +28,19 @@ public static ArrayList<Edge> Convert2Edges(HashMap<Node, NeighborList> graph) {
         return edges;
     }
 
+    /**
+     * Copy constructor.
+     *
+     * @param origin
+     */
+    public NeighborList(final NeighborList origin) {
+        super(origin.size());
+        for (Neighbor neighbor : origin) {
+            this.add(neighbor);
+        }
+
+    }
+
     /**
      * Create a new neighborlist of given size.
      * @param size size of the neighborlist