-
Notifications
You must be signed in to change notification settings - Fork 1
/
Copy pathgraph_representation_in_adjacency_matrix.py
263 lines (225 loc) · 7.4 KB
/
graph_representation_in_adjacency_matrix.py
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
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
# -----------------------------------------------
# Author : Mohit Chaudhari
# Created Date : 14/12/21
# -----------------------------------------------
# GRAPH REPRESENTATION - ADJACENCY MATRIX
class Graph:
def __init__(self, vertices):
self._vertices = vertices
self._adj_matrix = list()
for _ in range(vertices):
self._adj_matrix.append([0] * vertices)
self._visited = [0] * vertices
def insert_edge(self, u, v, w=1):
self._adj_matrix[u][v] = w
def remove_edge(self, u, v):
self._adj_matrix[u][v] = 0
def exist_edge(self, u, v):
return self._adj_matrix[u][v] != 0
def vertex_count(self):
return self._vertices
def edge_count(self):
count = 0
for u in range(self._vertices):
for v in range(self._vertices):
if self._adj_matrix[u][v] != 0:
count += 1
return count
def vertices(self):
for i in range(self._vertices):
print(i, end=" ")
print()
def edges(self):
for u in range(self._vertices):
for v in range(self._vertices):
if self._adj_matrix[u][v] != 0:
print(u, "--", v)
def outdegree(self, v):
count = 0
for j in range(self._vertices):
if self._adj_matrix[v][j] != 0:
count += 1
return count
def indegree(self, v):
count = 0
for j in range(self._vertices):
if self._adj_matrix[j][v] != 0:
count += 1
return count
def display_adj_matrix(self):
# print(self._adj_matrix)
for i in range(self._vertices):
print(self._adj_matrix[i])
def bfs(self, s):
i = s
q = list()
q.append(i)
print(i, end=" ")
while q:
i = q.pop(0)
self._visited[i] = 1
for v in range(self._vertices):
if self._adj_matrix[i][v] != 0 and self._visited[v] == 0:
self._visited[v] = 1
print(v, end=" ")
q.append(v)
def dfs(self, s):
if self._visited[s] == 0:
print(s, end=" ")
self._visited[s] = 1
for j in range(self._vertices):
if self._adj_matrix[s][j] == 1 and self._visited[j] == 0:
self.dfs(j)
def undirected_graph():
G = Graph(4)
G.display_adj_matrix()
print("\n - Edges count : ", G.edge_count())
print("\n - Vertex count : ", G.vertex_count())
G.insert_edge(0, 1)
G.insert_edge(0, 2)
G.insert_edge(1, 0)
G.insert_edge(1, 2)
G.insert_edge(2, 0)
G.insert_edge(2, 1)
G.insert_edge(2, 3)
G.insert_edge(3, 2)
G.display_adj_matrix()
print("\n - Edges count : ", G.edge_count())
G.edges()
print("\n - Edge between 1 - 3 : ", G.exist_edge(1, 3))
print("\n - Edge between 1 - 2 : ", G.exist_edge(1, 2))
print("\n - InDegree of 2 : ", G.indegree(2))
print("\n - OutDegree of 2 : ", G.outdegree(2))
G.remove_edge(1, 2)
print("\n - Edge between 1 - 2 : ", G.exist_edge(1, 2))
def weighted_undirected_graph():
G = Graph(4)
G.display_adj_matrix()
print("\n - Edges count : ", G.edge_count())
print("\n - Vertex count : ", G.vertex_count())
G.insert_edge(0, 1, 26)
G.insert_edge(0, 2, 16)
G.insert_edge(1, 0, 26)
G.insert_edge(1, 2, 12)
G.insert_edge(2, 0, 16)
G.insert_edge(2, 1, 12)
G.insert_edge(2, 3, 8)
G.insert_edge(3, 2, 8)
G.display_adj_matrix()
print("\n - Edges count : ", G.edge_count())
G.edges()
print("\n - Edge between 1 - 3 : ", G.exist_edge(1, 3))
print("\n - Edge between 1 - 2 : ", G.exist_edge(1, 2))
print("\n - InDegree of 2 : ", G.indegree(2))
print("\n - OutDegree of 2 : ", G.outdegree(2))
G.remove_edge(1, 2)
print("\n - Edge between 1 - 2 : ", G.exist_edge(1, 2))
def directed_graph():
G = Graph(4)
G.display_adj_matrix()
print("\n - Edges count : ", G.edge_count())
print("\n - Vertex count : ", G.vertex_count())
G.insert_edge(0, 1)
G.insert_edge(0, 2)
G.insert_edge(1, 2)
G.insert_edge(2, 3)
G.display_adj_matrix()
print("\n - Edges count : ", G.edge_count())
G.edges()
print("\n - Edge between 1 - 3 : ", G.exist_edge(1, 3))
print("\n - Edge between 1 - 2 : ", G.exist_edge(1, 2))
print("\n - InDegree of 2 : ", G.indegree(2))
print("\n - OutDegree of 2 : ", G.outdegree(2))
G.remove_edge(1, 2)
print("\n - Edge between 1 - 2 : ", G.exist_edge(1, 2))
def weighted_directed_graph():
G = Graph(4)
G.display_adj_matrix()
print("\n - Edges count : ", G.edge_count())
print("\n - Vertex count : ", G.vertex_count())
G.insert_edge(0, 1, 26)
G.insert_edge(0, 2, 16)
G.insert_edge(1, 2, 12)
G.insert_edge(2, 3, 8)
G.display_adj_matrix()
print("\n - Edges count : ", G.edge_count())
G.edges()
print("\n - Edge between 1 - 3 : ", G.exist_edge(1, 3))
print("\n - Edge between 1 - 2 : ", G.exist_edge(1, 2))
print("\n - InDegree of 2 : ", G.indegree(2))
print("\n - OutDegree of 2 : ", G.outdegree(2))
G.remove_edge(1, 2)
print("\n - Edge between 1 - 2 : ", G.exist_edge(1, 2))
def breadth_first_search():
G = Graph(7)
G.insert_edge(0, 1)
G.insert_edge(0, 6)
G.insert_edge(0, 5)
G.insert_edge(1, 0)
G.insert_edge(1, 6)
G.insert_edge(1, 2)
G.insert_edge(1, 5)
G.insert_edge(2, 6)
G.insert_edge(2, 4)
G.insert_edge(2, 3)
G.insert_edge(3, 4)
G.insert_edge(4, 2)
G.insert_edge(4, 5)
G.insert_edge(5, 2)
G.insert_edge(5, 3)
G.insert_edge(6, 3)
G.display_adj_matrix()
print("\n - InDegree of 5 : ", G.indegree(5))
print("\n - OutDegree of 5 : ", G.outdegree(5))
print("\n - BFS FROM NODE 1 : ", end=" ")
G.bfs(1)
print()
def depth_first_search():
G = Graph(7)
G.insert_edge(0, 1)
G.insert_edge(0, 6)
G.insert_edge(0, 5)
G.insert_edge(1, 0)
G.insert_edge(1, 6)
G.insert_edge(1, 2)
G.insert_edge(1, 5)
G.insert_edge(2, 6)
G.insert_edge(2, 4)
G.insert_edge(2, 3)
G.insert_edge(3, 4)
G.insert_edge(4, 2)
G.insert_edge(4, 5)
G.insert_edge(5, 2)
G.insert_edge(5, 3)
G.insert_edge(6, 3)
G.display_adj_matrix()
print("\n - InDegree of 5 : ", G.indegree(5))
print("\n - OutDegree of 5 : ", G.outdegree(5))
print("\n - DFS FROM NODE 1 : ", end=" ")
G.dfs(1)
print()
if __name__ == '__main__':
print("-" * 20, " UNDIRECTED GRAPH ", "-" * 20)
undirected_graph()
print("-" * 20, " UNDIRECTED GRAPH END ", "-" * 20)
print("\n")
print("-" * 20, " WEIGHTED UNDIRECTED GRAPH ", "-" * 20)
weighted_undirected_graph()
print("-" * 20, " WEIGHTED UNDIRECTED GRAPH END ", "-" * 20)
print("\n")
print("-" * 20, " DIRECTED GRAPH ", "-" * 20)
directed_graph()
print("-" * 20, " DIRECTED GRAPH END ", "-" * 20)
print("\n")
print("-" * 20, " WEIGHTED DIRECTED GRAPH ", "-" * 20)
weighted_directed_graph()
print("-" * 20, " WEIGHTED DIRECTED GRAPH END ", "-" * 20)
print("\n")
print("-" * 20, " BREADTH FIRST SEARCH ", "-" * 20)
breadth_first_search()
print("-" * 20, " BREADTH FIRST SEARCH END ", "-" * 20)
print("\n")
print("-" * 20, " DEPTH FIRST SEARCH ", "-" * 20)
depth_first_search()
print("-" * 20, " DEPTH FIRST SEARCH END ", "-" * 20)
print("\n")