# Path: pyalgs/data_structures/graphs/graph.py
# class Graph(object):
#     V = 0
#     adjList = None
# 
#     def __init__(self, V):
#         self.V = V
#         self.adjList = [None] * V
#         for v in range(V):
#             self.adjList[v] = Bag()
# 
#     def vertex_count(self):
#         return self.V
# 
#     def adj(self, v):
#         return self.adjList[v].iterate()
# 
#     def add_edge(self, v, w):
#         self.adjList[v].add(w)
#         self.adjList[w].add(v)
# 
# class Digraph(object):
#     V = 0
#     adjList = None
# 
#     def __init__(self, V):
#         self.V = V
#         self.adjList = [None] * V
#         for v in range(V):
#             self.adjList[v] = Bag()
# 
#     def vertex_count(self):
#         return self.V
# 
#     def adj(self, v):
#         return self.adjList[v].iterate()
# 
#     def add_edge(self, v, w):
#         self.adjList[v].add(w)
# 
#     def reverse(self):
#         g = Digraph(self.V)
#         for v in range(self.V):
#             for w in self.adjList[v].iterate():
#                 g.add_edge(w, v)
# 
#         return g


import unittest
from pyalgs.data_structures.graphs.graph import Graph, Digraph



class GraphUnitTest(unittest.TestCase):
    def test_graph(self):
        G = Graph(100)

        G.add_edge(1, 2)

# Path: pyalgs/data_structures/graphs/graph.py
# class Graph(object):
#     V = 0
#     adjList = None
# 
#     def __init__(self, V):
#         self.V = V
#         self.adjList = [None] * V
#         for v in range(V):
#             self.adjList[v] = Bag()
# 
#     def vertex_count(self):
#         return self.V
# 
#     def adj(self, v):
#         return self.adjList[v].iterate()
# 
#     def add_edge(self, v, w):
#         self.adjList[v].add(w)
#         self.adjList[w].add(v)
# 
# class Digraph(object):
#     V = 0
#     adjList = None
# 
#     def __init__(self, V):
#         self.V = V
#         self.adjList = [None] * V
#         for v in range(V):
#             self.adjList[v] = Bag()
# 
#     def vertex_count(self):
#         return self.V
# 
#     def adj(self, v):
#         return self.adjList[v].iterate()
# 
#     def add_edge(self, v, w):
#         self.adjList[v].add(w)
# 
#     def reverse(self):
#         g = Digraph(self.V)
#         for v in range(self.V):
#             for w in self.adjList[v].iterate():
#                 g.add_edge(w, v)
# 
#         return g


# Path: tests/data_structures/graphs/graph_unit_test.py
import unittest
from pyalgs.data_structures.graphs.graph import Graph, Digraph




class GraphUnitTest(unittest.TestCase):
    def test_graph(self):
        G = Graph(100)

        G.add_edge(1, 2)

        G.add_edge(1, 3)