-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathincidence_matrix.py
111 lines (89 loc) Β· 2.25 KB
/
incidence_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
def incidence_matrix_to_edge_list():
i_m = [[1, 0, 1, 0, 0], [1, 1, 0, 0, 1], [0, 1, 1, 1, 0], [0, 0, 0, 1, 1]]
e_l = []
vertices = {}
pares = {}
for i in range(len(i_m)):
vertices[i+1] = []
for i in range(len(i_m)):
for j in range(len(i_m[i])):
if i_m[i][j] == 1:
vertices[i+1].append(j)
for i in range(len(i_m)):
for j in vertices.keys():
if i+1 != j:
for k in vertices[i+1]:
if k in vertices[j]:
aux = []
aux.append(i+1)
aux.append(j)
pares[i+1] = j
if j not in pares:
e_l.append(aux)
print('Incidence Matrix: '+str(i_m))
print('Edge List: '+str(e_l))
incidence_matrix_to_edge_list()
def incidence_matrix_to_adjacency_matrix(len_m):
i_m = [[1, 0, 1, 0, 0], [1, 1, 0, 0, 1], [0, 1, 1, 1, 0], [0, 0, 0, 1, 1]]
a_m = []
vertices = {}
pares = {}
for i in range(len_m):
a_m.append([0]*len_m)
for i in range(len(i_m)):
vertices[i+1] = []
for i in range(len(i_m)):
for j in range(len(i_m[i])):
if i_m[i][j] == 1:
vertices[i+1].append(j)
for i in range(len(i_m)):
for j in vertices.keys():
if i+1 != j:
for k in vertices[i+1]:
if k in vertices[j]:
a_m[i][j-1] = 1
print('Adjacency Matrix: '+str(a_m))
incidence_matrix_to_adjacency_matrix(4)
def adjacency_list_to_star():
a_l = incidence_matrix_to_adjacency_list()
vertex_pointer = {}
pointer_al = {}
num = 1
cont = 0
for i in a_l.keys():
for j in a_l[i]:
cont = cont+1
if cont == 1:
vertex_pointer[i] = num
pointer_al[num] = j
num = num + 1
cont = 0
pointer_al[num] = 0
vertex_pointer[i+1] = num
print('Star: ')
print(str(pointer_al))
print(str(vertex_pointer))
def incidence_matrix_to_adjacency_list():
i_m = [[1, 0, 1, 0, 0], [1, 1, 0, 0, 1], [0, 1, 1, 1, 0], [0, 0, 0, 1, 1]]
e_l = []
vertices = {}
a_l = {}
for i in range(len(i_m)):
vertices[i+1] = []
for i in range(len(i_m)):
a_l[i+1] = []
for i in range(len(i_m)):
for j in range(len(i_m[i])):
if i_m[i][j] == 1:
vertices[i+1].append(j)
for i in range(len(i_m)):
for j in vertices.keys():
if i+1 != j:
for k in vertices[i+1]:
if k in vertices[j]:
a_l[i+1].append(j)
print('Adjacency List: '+str(a_l))
return a_l
def incidence_matrix_to_star():
adjacency_list_to_star()
incidence_matrix_to_star()