Graph implementation (#47)

* Added all the test files into one test_cases folder

* Created a folder named Graph_implementation and added 3 files in it, 1)Graph.py which contains all the methods, 2) SearchAlgorithms.py which contains some searching algos. and 3)main.py

* Added 'test_cases' folder under which added test cases files for graph implementation are added

Author: Ayushlion8

test_cases/graph.py Test Cases.py

@@ -0,0 +1,20 @@
+# Import the necessary modules and classes from graph.py
+from easyPythonpi.Graph_implementation.Graph import Graph
+
+# Create an instance of the Graph class
+graph = Graph()
+
+# Test adding edges
+def test_add_edge():
+    graph.add_edge('A', 'B')
+    graph.add_edge('A', 'C')
+    graph.add_edge('B', 'C')
+    assert 'A' in graph.graph
+    assert 'B' in graph.graph
+    assert 'C' in graph.graph
+    assert 'B' in graph.graph['A']
+    assert 'C' in graph.graph['A']
+    assert 'C' in graph.graph['B']
+
+# Run the test
+test_add_edge()

test_cases/main.py Test Cases.py

@@ -0,0 +1,25 @@
+# Import the necessary modules and classes from main.py
+from easyPythonpi.Graph_implementation.main import Graph, bfs, dfs
+
+# Create an instance of the Graph class
+graph = Graph()
+
+# Add edges to the graph
+graph.add_edge('A', 'B')
+graph.add_edge('A', 'C')
+graph.add_edge('B', 'C')
+graph.add_edge('C', 'D')
+
+# Test Breadth-First Search (BFS) from main.py
+def test_bfs():
+    result = bfs(graph.graph, 'A')
+    assert result == ['A', 'B', 'C', 'D']
+
+# Test Depth-First Search (DFS) from main.py
+def test_dfs():
+    result = dfs(graph.graph, 'A')
+    assert result == ['A', 'B', 'C', 'D']
+
+# Run the tests
+test_bfs()
+test_dfs()

test_cases/searchalgorithms.py Test Cases.py

@@ -0,0 +1,26 @@
+# Import the necessary modules and functions from searchalgorithms.py
+from easyPythonpi.Graph_implementation.SearchAlgorithms import bfs, dfs
+
+# Create a sample graph for testing
+graph = {
+    'A': ['B', 'C'],
+    'B': ['C', 'D'],
+    'C': ['D'],
+    'D': ['C'],
+    'E': ['F'],
+    'F': ['C'],
+}
+
+# Test Breadth-First Search (BFS)
+def test_bfs():
+    result = bfs(graph, 'A')
+    assert result == ['A', 'B', 'C', 'D']
+
+# Test Depth-First Search (DFS)
+def test_dfs():
+    result = dfs(graph, 'A')
+    assert result == ['A', 'B', 'C', 'D']
+
+# Run the tests
+test_bfs()
+test_dfs()