Added Graphs

Author: OmkarPathak

pygorithm/data_structures/heap.py

@@ -4,13 +4,8 @@
     stack,
     queue,
     linked_list,
-<<<<<<< Updated upstream
-    tree)
-=======
     tree,
-    heap,
     graph)
->>>>>>> Stashed changes
 
 class TestStack(unittest.TestCase):
     def test_stack(self):
@@ -137,37 +132,6 @@ def test_binary_search_tree(self):
 
         self.assertTrue(root.find(8))
 
-<<<<<<< Updated upstream
-=======
-class TestHeap(unittest.TestCase):
-    def test_heap(self):
-        myHeap = heap.Heap(limit = 4)
-        myHeap.insert(2)   # [2]
-        myHeap.insert(10)  # [2, 10]
-        myHeap.insert(12)  # [2, 10, 12]
-        myHeap.insert(3)   # [2,  3, 10, 12]
-
-        expectedResult = [2, 3, 10, 12]
-        self.assertEqual(myHeap.queue(), expectedResult)
-
-        self.assertEqual(myHeap.pop(), 2)
-        expectedResult = [3, 10, 12]
-        self.assertEqual(myHeap.queue(), expectedResult)
-
-        self.assertEqual(myHeap.pop(), 3)
-        expectedResult = [10, 12]
-        self.assertEqual(myHeap.queue(), expectedResult)
-
-        self.assertEqual(myHeap.pop(), 10)
-        expectedResult = [12]
-        self.assertEqual(myHeap.queue(), expectedResult)
-
-        self.assertEqual(myHeap.pop(), 12)
-        expectedResult = []
-        self.assertEqual(myHeap.queue(), expectedResult)
-
-        self.assertTrue(myHeap.is_empty())
-
 class TestGraph(unittest.TestCase):
     def test_topological_sort(self):
         myGraph = graph.TopologicalSort()
@@ -182,6 +146,5 @@ def test_topological_sort(self):
         expectedResult = [5, 4, 2, 3, 1, 0]
         self.assertEqual(ans, expectedResult)
 
->>>>>>> Stashed changes
 if __name__ == '__main__':
     unittest.main()