Change all tabs for spaces

dalleng · dalleng · commit 7ea83db5d4bf · 2014-01-02T22:47:29.000-03:00
diff --git a/Prim_Minimum_Spanning_Tree/Java/dalleng/PrimMST.java b/Prim_Minimum_Spanning_Tree/Java/dalleng/PrimMST.java
@@ -9,40 +9,40 @@
 import java.util.Set;
 
 public class PrimMST {
-	static Map<Integer, HashMap<Integer, Double>> adjacencyList = new HashMap<Integer, HashMap<Integer, Double>>();
-	static Set<Integer> mst = new HashSet<Integer>();
-
-	static void addEdge(int from, int to, double weight) {
-		if (adjacencyList.containsKey(from)) {
-			adjacencyList.get(from).put(to, weight);
-		} else {
-			HashMap<Integer, Double> edges = new HashMap<Integer, Double>();
-			edges.put(to, weight);
-			adjacencyList.put(from, edges);
-		}
-	}
-
-
-	static Set<Entry<Integer, Double>> neighborsAndWeight(int node) {
-		Set<Entry<Integer, Double>> neighborsAndWeight = new HashSet<Entry<Integer, Double>>();
-		if (adjacencyList.containsKey(node)) {
-			neighborsAndWeight = adjacencyList.get(node).entrySet();
-		}
-		return neighborsAndWeight;
-	}
-
-	static double prim(int start) {
-		HashSet<Integer> visited = new HashSet<Integer>();
-		Integer lastInserted = start;
-		double sum = 0;
-		visited.add(start);
-
-		PriorityQueue<WeightedEdge> possibleEdges = new PriorityQueue<Main.WeightedEdge>();
-
-		while (adjacencyList.size() != visited.size()) {
-			for (Entry<Integer, Double> nw : neighborsAndWeight(lastInserted)) {
-				possibleEdges.add(new WeightedEdge(lastInserted, nw.getKey(), nw.getValue()));
-			}
+    static Map<Integer, HashMap<Integer, Double>> adjacencyList = new HashMap<Integer, HashMap<Integer, Double>>();
+    static Set<Integer> mst = new HashSet<Integer>();
+
+    static void addEdge(int from, int to, double weight) {
+        if (adjacencyList.containsKey(from)) {
+            adjacencyList.get(from).put(to, weight);
+        } else {
+            HashMap<Integer, Double> edges = new HashMap<Integer, Double>();
+            edges.put(to, weight);
+            adjacencyList.put(from, edges);
+        }
+    }
+
+
+    static Set<Entry<Integer, Double>> neighborsAndWeight(int node) {
+        Set<Entry<Integer, Double>> neighborsAndWeight = new HashSet<Entry<Integer, Double>>();
+        if (adjacencyList.containsKey(node)) {
+            neighborsAndWeight = adjacencyList.get(node).entrySet();
+        }
+        return neighborsAndWeight;
+    }
+
+    static double prim(int start) {
+        HashSet<Integer> visited = new HashSet<Integer>();
+        Integer lastInserted = start;
+        double sum = 0;
+        visited.add(start);
+
+        PriorityQueue<WeightedEdge> possibleEdges = new PriorityQueue<Main.WeightedEdge>();
+
+        while (adjacencyList.size() != visited.size()) {
+            for (Entry<Integer, Double> nw : neighborsAndWeight(lastInserted)) {
+                possibleEdges.add(new WeightedEdge(lastInserted, nw.getKey(), nw.getValue()));
+            }
 
             WeightedEdge edge = possibleEdges.poll();
 
@@ -56,36 +56,36 @@ static double prim(int start) {
             sum += edge.weight;
         }
 
-		return sum;
-	}
-
-	static class WeightedEdge implements Comparable<WeightedEdge> {
-		public int from;
-		public int to;
-		public double weight;
-
-		public WeightedEdge(int from, int to, double weight) {
-			super();
-			this.from = from;
-			this.to = to;
-			this.weight = weight;
-		}
-
-		@Override
-		public int compareTo(WeightedEdge anotherElement) {
-			int ret;
-
-			if (this.weight < anotherElement.weight) {
-				ret = -1;
-			} else if (this.weight == anotherElement.weight) {
-				ret = 0;
-			} else {
-				ret = 1;
-			}
-
-			return ret;
-		}
-
-	}
+        return sum;
+    }
+
+    static class WeightedEdge implements Comparable<WeightedEdge> {
+        public int from;
+        public int to;
+        public double weight;
+
+        public WeightedEdge(int from, int to, double weight) {
+            super();
+            this.from = from;
+            this.to = to;
+            this.weight = weight;
+        }
+
+        @Override
+        public int compareTo(WeightedEdge anotherElement) {
+            int ret;
+
+            if (this.weight < anotherElement.weight) {
+                ret = -1;
+            } else if (this.weight == anotherElement.weight) {
+                ret = 0;
+            } else {
+                ret = 1;
+            }
+
+            return ret;
+        }
+
+    }
 
 }
