Direct, Undirect Graph

Graph.py

# Direct Graph
class DGraph:
    def __init__(self):
        self.__nodes = {}
    def add(self,name,edgelist):
        # name , edgelist
        self.__nodes[name] = edgelist
    def remove(self,name):
        del self.__nodes[name]
    def printAll(self):
        for data in self.__nodes.keys():
            print(f'{data} -> {self.__nodes[data]}')
# Undirect Graph
class UGraph:
    def __init__(self):
        self.__nodes = {}
    def add(self,name,edgelist):
        # [('A','B'),('A','C')]
        self.__nodes[name] = edgelist
    def remove(self,name):
        del self.__nodes[name]
    def printAll(self):
        for data in self.__nodes.keys():
            print(f'{data}의 인접 리스트 : {[i[1] for i in self.__nodes[data]]}')