From a920bcec8ddf42ef6b7740817bb53adbeac7bf94 Mon Sep 17 00:00:00 2001
From: buzz-dee <deezzub@gmail.com>
Date: Thu, 27 Jan 2011 20:16:12 +0100
Subject: [PATCH] sinkSet method for computing the min-cut implemented

---
 DiePaten.java | 25 +++++++++++++++++++++++++
 1 file changed, 25 insertions(+)

diff --git a/DiePaten.java b/DiePaten.java
index 6a2085e..c082818 100644
--- a/DiePaten.java
+++ b/DiePaten.java
@@ -148,6 +148,31 @@ public ArrayList<Integer> sourceSet() {
 		
 		return source_Set;
 	}
+	
+	public ArrayList<Integer> sinkSet() {
+		ArrayList<Integer> source_Set = new ArrayList<Integer>();
+		ArrayList<Integer> sink_Set = new ArrayList<Integer>();
+		source_Set = sourceSet();
+		
+		for (int i = 0; i < size; i++) {
+			sink_Set.add(i);
+			for (int j = 0; j < source_Set.size(); j++) {
+				if (source_Set.indexOf(j) == sink_Set.indexOf(i)) {
+					sink_Set.remove(i);
+				}
+			}
+		}
+		
+		return sink_Set;
+	}
+	
+	public ArrayList<Edge> minCut() {
+		ArrayList<Edge> min_Cut = new ArrayList<Edge>();
+		
+		
+		
+		return min_Cut;
+	}
 
 
 	public int maxFlow(int[][] adjacencyMatrix, String[][] capacityMatrix,