s434740/djfz-2019
1
0
Fork 0
Code Issues Pull Requests Releases Wiki Activity

'hm'

Browse Source
This commit is contained in:
deadsmond 2019-11-25 20:41:48 +01:00
parent 0da51d11d7
commit 1d555b2226
1 changed files with 5 additions and 14 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

19
TaskB01/run
View File

@ -58,21 +58,12 @@ class automata:
result = [] result = []
# if the node exists # if the node exists
if self.graph[q]: if self.graph[q]:
# search through all its to find value # search through all its connections to find value
for connections in self.graph[q]:
for dic in self.graph[q]: for value in connections:
for element in dic: if value == i:
print(element)
for transition in self.graph[q]:
print(transition, i)
try:
if transition[i]:
# append next node # append next node
result.append(transition[i]) result.append(connections[value])
except KeyError:
# there is no value like that (element from the outside of alphabet)
return []
# return list of next nodes # return list of next nodes
return result return result