Restoring all untracked test files

Author: Susmita-Chakrabarty

tests/__init__.py

@@ -0,0 +1,44 @@
+from pydatastructs.graphs import Graph
+from pydatastructs.utils import AdjacencyListGraphNode
+from pydatastructs.utils.raises_util import raises
+
+def test_adjacency_list():
+    v_1 = AdjacencyListGraphNode('v_1', 1)
+    v_2 = AdjacencyListGraphNode('v_2', 2)
+    g = Graph(v_1, v_2, implementation='adjacency_list')
+    v_3 = AdjacencyListGraphNode('v_3', 3)
+    g.add_vertex(v_2)
+    g.add_vertex(v_3)
+    g.add_edge('v_1', 'v_2')
+    g.add_edge('v_2', 'v_3')
+    g.add_edge('v_3', 'v_1')
+    assert g.is_adjacent('v_1', 'v_2') is True
+    assert g.is_adjacent('v_2', 'v_3') is True
+    assert g.is_adjacent('v_3', 'v_1') is True
+    assert g.is_adjacent('v_2', 'v_1') is False
+    assert g.is_adjacent('v_3', 'v_2') is False
+    assert g.is_adjacent('v_1', 'v_3') is False
+    neighbors = g.neighbors('v_1')
+    assert neighbors == [v_2]
+    v = AdjacencyListGraphNode('v', 4)
+    g.add_vertex(v)
+    g.add_edge('v_1', 'v', 0)
+    g.add_edge('v_2', 'v', 0)
+    g.add_edge('v_3', 'v', 0)
+    assert g.is_adjacent('v_1', 'v') is True
+    assert g.is_adjacent('v_2', 'v') is True
+    assert g.is_adjacent('v_3', 'v') is True
+    e1 = g.get_edge('v_1', 'v')
+    e2 = g.get_edge('v_2', 'v')
+    e3 = g.get_edge('v_3', 'v')
+    assert (e1.source.name, e1.target.name) == ('v_1', 'v')
+    assert (e2.source.name, e2.target.name) == ('v_2', 'v')
+    assert (e3.source.name, e3.target.name) == ('v_3', 'v')
+    g.remove_edge('v_1', 'v')
+    assert g.is_adjacent('v_1', 'v') is False
+    g.remove_vertex('v')
+    assert g.is_adjacent('v_2', 'v') is False
+    assert g.is_adjacent('v_3', 'v') is False
+
+    assert raises(ValueError, lambda: g.add_edge('u', 'v'))
+    assert raises(ValueError, lambda: g.add_edge('v', 'x'))

tests/test_adjacency_list.py

@@ -0,0 +1,32 @@
+from pydatastructs.graphs import Graph
+from pydatastructs.utils import AdjacencyMatrixGraphNode
+from pydatastructs.utils.raises_util import raises
+
+def test_AdjacencyMatrix():
+    v_0 = AdjacencyMatrixGraphNode(0, 0)
+    v_1 = AdjacencyMatrixGraphNode(1, 1)
+    v_2 = AdjacencyMatrixGraphNode(2, 2)
+    g = Graph(v_0, v_1, v_2)
+    g.add_edge(0, 1, 0)
+    g.add_edge(1, 2, 0)
+    g.add_edge(2, 0, 0)
+    e1 = g.get_edge(0, 1)
+    e2 = g.get_edge(1, 2)
+    e3 = g.get_edge(2, 0)
+    assert (e1.source.name, e1.target.name) == ('0', '1')
+    assert (e2.source.name, e2.target.name) == ('1', '2')
+    assert (e3.source.name, e3.target.name) == ('2', '0')
+    assert g.is_adjacent(0, 1) is True
+    assert g.is_adjacent(1, 2) is True
+    assert g.is_adjacent(2, 0) is True
+    assert g.is_adjacent(1, 0) is False
+    assert g.is_adjacent(2, 1) is False
+    assert g.is_adjacent(0, 2) is False
+    neighbors = g.neighbors(0)
+    assert neighbors == [v_1]
+    g.remove_edge(0, 1)
+    assert g.is_adjacent(0, 1) is False
+    assert raises(ValueError, lambda: g.add_edge('u', 'v'))
+    assert raises(ValueError, lambda: g.add_edge('v', 'x'))
+    assert raises(ValueError, lambda: g.add_edge(2, 3))
+    assert raises(ValueError, lambda: g.add_edge(3, 2))