Merge branch 'master' of https://github.com/OmkarPathak/pygorithms

'Updated'

Author: OmkarPathak

README.rst

@@ -31,7 +31,7 @@ Installation
    pip3 install pygorithm
 
 - | It's that easy. If you are using Python 2.7 use pip instead. Depending on your
-  | permissions, you might need to ``sudo`` before installing
+  | permissions, you might need to use ``pip install --user pygorithm`` to install.
 
 
 Quick Start Guide

pygorithm/searching/breadth_first_search.py

@@ -2,7 +2,7 @@
 # Created On: 1st August 2017
 
 #  breadth first search algorithm
-def bfs(graph, startVertex):
+def search(graph, startVertex):
     # Take a list for stoting already visited vertexes
     if startVertex not in graph or graph[startVertex] is None or graph[startVertex] == []:
         return None
@@ -25,4 +25,4 @@ def time_complexities():
 # easily retrieve the source code of the bfs function
 def get_code():
     import inspect
-    return inspect.getsource(bfs)
+    return inspect.getsource(search)

pygorithm/searching/depth_first_search.py

@@ -2,7 +2,7 @@
 # Created On: 1st August 2017
 
 #  depth first search algorithm
-def dfs(graph, start, path = []):
+def search(graph, start, path = []):
     # check if graph is empty or start vertex is none
     if start not in graph or graph[start] is None or graph[start] == []:
         return None
@@ -19,4 +19,4 @@ def time_complexities():
 # easily retrieve the source code of the dfs function
 def get_code():
     import inspect
-    return inspect.getsource(dfs)
+    return inspect.getsource(search)

tests/searching_tests.py

@@ -47,9 +47,9 @@ def test_bfs(self):
             'E': {'A'},
             'G': {'C'}
         }
-        result = breadth_first_search.bfs(self.graph, 'A')
+        result = breadth_first_search.search(self.graph, 'A')
         self.assertEqual(result, {'A', 'B', 'D', 'F', 'C', 'G', 'E'})
-        result = breadth_first_search.bfs(self.graph, 'G')
+        result = breadth_first_search.search(self.graph, 'G')
         self.assertEqual(result, {'G', 'C', 'A', 'B', 'D', 'F', 'E'})
 
 class DFSSearch(unittest.TestCase):
@@ -63,9 +63,9 @@ def test_dfs(self):
             'E': ['A'],
             'G': ['C']
         }
-        result = depth_first_search.dfs(self.graph, 'A')
+        result = depth_first_search.search(self.graph, 'A')
         self.assertEqual(result, ['A', 'B', 'D', 'F', 'C', 'G', 'E'])
-        result = depth_first_search.dfs(self.graph, 'G')
+        result = depth_first_search.search(self.graph, 'G')
         self.assertEqual(result, ['G', 'C', 'A', 'B', 'D', 'F', 'E'])
 
 if __name__ == '__main__':