This commit is contained in:
deadsmond 2019-11-25 20:11:08 +01:00
parent bd7b567b62
commit c394833efe

View File

@ -60,12 +60,9 @@ class automata:
if self.graph[q]:
# search through all its connections to find value
for transition in self.graph[q]:
print(transition)
# if value is like searched for
for key in transition:
if key == i:
# append next node
result.append(transition[key])
if transition[i]:
# append next node
result.append(transition[i])
# return list of next nodes
return result