-
Notifications
You must be signed in to change notification settings - Fork 4
/
problem12.py
173 lines (161 loc) · 5.58 KB
/
problem12.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
from problem import Problem
import random
from random import randrange
n = randrange(9, 13, 1) #se genereaza numarul de noduri
class Problem12(Problem):
def __init__(self):
statement="Reconstruiti un arbore oarecare, primind o parcurgere continua in adancime a arborelui, pornind din radacina.\nParcurgerea DFS continua:\n"
class date_nod:
def __init__(self, valoare, children):
self.valoare = valoare
self.children = children
lista1 = list(range(1, n))
radacina = random.choice(lista1)
lista = list(range(1, n + 1))
lista.remove(radacina)
lista_nrfii = list(range(1, 5))
v = []
fii = []
cnt = 1
nod = []
v.append(radacina)
j = 0
contor = 0
while cnt < n:
nr_fii = random.choice(lista_nrfii)
while nr_fii > n - cnt:
nr_fii = random.choice(lista_nrfii)
for i in range(0, nr_fii):
fii.append(random.choice(lista))
cnt += 1
v.append(fii[i])
lista.remove(fii[i])
radacina = v[0]
copii = []
i = 0
while i < len(fii):
copii.append(fii[i])
i += 1
nod.append(date_nod(radacina, copii))
contor += 1
v.pop(0)
fii.clear()
j += 1
# Listele de adiacenta
#for i in range(0, j):
# print(nod[i].valoare, ':', nod[i].children)
# DFS CONTINUA:
stiva = []
vizitat = []
for i in range(0, n):
vizitat.append(0)
dfs = []
dfs.append(nod[0].valoare) # radacina
stiva.append(nod[0].valoare)
nr = 1
tata = []
for i in range(0, contor):
tata.append(nod[i].valoare)
while nr <= n and len(stiva) > 0:
gasit_nod_neviz = 0
ok = 0
while ok == 0:
val = stiva[len(stiva) - 1]
for k in tata:
if k == val:
i = tata.index(val)
ok = 1
if ok == 0:
stiva.pop()
dfs.append(stiva[len(stiva) - 1])
for j in range(0, len(nod[i].children)):
if vizitat[(nod[i].children)[j] - 1] == 0:
gasit_nod_neviz = 1
vizitat[(nod[i].children)[j] - 1] = 1
stiva.append((nod[i].children)[j])
dfs.append((nod[i].children)[j])
nr += 1
break
if gasit_nod_neviz == 0:
stiva.pop()
if len(stiva) > 0:
dfs.append(stiva[len(stiva) - 1])
data=dfs
statement+=str(data)
super().__init__(statement, data)
def solve(self):
solution = ""
vect = self.data
#solution+='\nparcurgerea este '+str(vect)
solution+='\nReconstruim arborele plecand de la parcurgerea data\n'
'''vizitat = [0] * 10
vizitat[vect[0] - 1] = 1
tata = sptata = [0] * 10
for i in range(1, len(vect)):
if vizitat[vect[i] - 1] == 0:
tata[vect[i] - 1] = vect[i - 1]
vizitat[vect[i] - 1] = 1
n = 0
def funct(nod, tata, vect, n):
nr = 0
#vizitat[nod - 1] = 1
for i in range(0, len(tata)):
if tata[i] == nod:
nr = nr + 1
if nod == vect[0]:
print(str(nod))
if nr == 0:
return
if nr != 0:
for i in range(0, len(tata)):
cop = n
if tata[i] == nod:
print(" " * n + "|---------" + str(i + 1))
n = n + 1
vizitat[i] = 1
funct(i + 1, tata, vect, n)
n = cop
funct(vect[0], tata, vect, n)'''
solution+='Pentru fiecare nou voi afisa fii lui'
vizitat = [0] * n
vizitat[vect[0] - 1] = 1
tata = [0] * n
for i in range(1, len(vect)):
if vizitat[vect[i] - 1] == 0:
tata[vect[i] - 1] = vect[i - 1]
vizitat[vect[i] - 1] = 1
p = 0
vizitat = [0] * n
def funct(nod, tata, vect, vizitat, p, sol=''):
nr = 0
for i in range(0, len(tata)):
if tata[i] == nod:
nr = nr + 1
if nr != 0:
sol += '\n'
sol += str(nod)
sol += '\n'
for i in range(0, len(tata)):
if tata[i] == nod:
sol += "\n " * p + "|---------" + str(i + 1) + '\n'
return sol
else:
return
vizi = [0] * n
nou = [0] * n
k = 0
for i in range(0, len(vect)):
if vizi[vect[i] - 1] == 0:
nou[k] = vect[i]
k += 1
vizi[vect[i] - 1] = 1
sol=''
for i in range(len(tata)):
a = funct(nou[i], tata, vect, vizitat, p)
# print("pentrul nodul "+str(nou[i])+":")
if a == None:
continue
else:
sol += a
solution+=sol
return solution