pythoner
diff --git a/‎README.md‎
Lines changed: 11 additions & 1 deletion b/‎README.md‎
Lines changed: 11 additions & 1 deletion
diff --git a/‎graphs/__init__.py‎ b/‎graphs/__init__.py‎
diff --git a/‎graphs/graph.py‎
Lines changed: 4 additions & 1 deletion b/‎graphs/graph.py‎
Lines changed: 4 additions & 1 deletion
diff --git a/‎greedy/scheduling.py‎
Lines changed: 0 additions & 10 deletions b/‎greedy/scheduling.py‎
Lines changed: 0 additions & 10 deletions
@@ -4,7 +4,7 @@ Algos in Python
 Implementation for the algorithms and datastructures taught in [CS161](http://openclassroom.stanford.edu/MainFolder/CoursePage.php?course=IntroToAlgorithms), in Python
 Includes test code - doctests for few and full unittests for others
 
-Completed Algos and Data Structures
+Completed
 ---
 - Karatsuba Multiplication
 - Basic Sorting
@@ -19,8 +19,18 @@ Completed Algos and Data Structures
     - Connected Components
     - Dijkstra's Shortest Path - O(mlogn)
     - Prim's Minimum Cost Spanning Tree - O(mlogn)
+    - Kruskal's Minimum Spanning Tree - O(mlogn)
 - Heap datastructure
 	- Max heaps
 	- Min heaps (priority queue)
 	- Heapsort
 - Job Scheduling
+- [UnionFind](http://en.wikipedia.org/wiki/Disjoint-set_data_structure) Data Structure
+
+Tests
+---
+    python -m tests.graph_test
+    python -m tests.digraph_test
+    python -m tests.graph_algorithms_test
+    python -m tests.heap_test
+    python -m tests.unionfind_test
@@ -159,10 +159,13 @@ def get_edge_weight(self, edge):
     def get_edge_weights(self):
         """ Returns a list of all edges with their weights """
         edge_list = []
+        unique_edges = []
         for node in self.nodes():
             for each in self.neighbors(node):
                 edge = (node, each)
-                edge_list.append((self.get_edge_weight(edge), edge))
+                if (each, node) not in unique_edges:
+                    edge_list.append((self.get_edge_weight(edge), edge))
+                    unique_edges.append(edge)
         return edge_list
 
     def add_node_attribute(self, node, attr):