Python_DSA_and_LeetCode/graph.py at main · nouman6093/Python_DSA_and_LeetCode · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
class Graph():
    def __init__(self):
        self.adjacency_list = {}

    def add_vertex(self, vertex):
        if vertex not in self.adjacency_list.keys():
            self.adjacency_list[vertex] = []
            return True
        else:
            return False

    def display(self):
        for i in self.adjacency_list:
            print(i, ": ", self.adjacency_list[i])

    def add_edge(self, v1, v2):
        if v1 in self.adjacency_list.keys() and v2 in self.adjacency_list.keys():
            self.adjacency_list[v1].append(v2)
            self.adjacency_list[v2].append(v1)
            return True
        else:
            return False

    def remove_edge(self, v1, v2):
        if v1 in self.adjacency_list.keys() and v2 in self.adjacency_list.keys():
            try:
                self.adjacency_list[v1].remove(v2)
                self.adjacency_list[v2].remove(v1)
                return True
            except ValueError:
                pass
            return True
        else:
            return False

    def remove_vertex(self, vertex):
        if vertex in self.adjacency_list.keys():
            for i in self.adjacency_list[vertex]:
                self.adjacency_list[i].remove(vertex)
            del self.adjacency_list[vertex]
            return True
        else:
            return False

g1 = Graph()