We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
1 parent b7cab9d commit dbece37Copy full SHA for dbece37
data_structures/graphs/Adjacency_matrix.py
@@ -0,0 +1,35 @@
1
+class Graph:
2
+
3
+ def __init__(self, vertices, directed: bool):
4
+ self.V = vertices
5
+ self.e = 0
6
+ self.d = directed
7
+ self.graph = []
8
+ for i in range(self.V):
9
+ lst = [0] * self.V
10
+ self.graph.append(lst)
11
12
+ def add_edge(self, ver1, ver2):
13
+ if self.d:
14
+ self.graph[ver1][ver2] = 1
15
+ else:
16
17
+ self.graph[ver2][ver1] = 1
18
19
+ def remove_edge(self, ver1, ver2):
20
+ if self.d[ver1][ver2] == 0:
21
+ print("No edge between %d and %d" % (ver1, ver2))
22
+ return
23
24
+ self.graph[ver1][ver2] = 0
25
26
27
+ self.graph[ver2][ver1] = 0
28
29
+ def print_graph(self):
30
+ for i in self.graph:
31
+ print(i)
32
33
34
35
0 commit comments