Commit 913e9407 authored by Adam P. Goucher's avatar Adam P. Goucher

Bugfix

parent 79ca5ef9
Pipeline #56195802 passed with stages
in 7 minutes and 54 seconds
......@@ -93,14 +93,15 @@ def binarise_tree(list_of_nodes, n_states, numInputs):
depth = node[0]
children = node[1:]
if (n_states < f_states):
children += ([max(0, (depth - 1) * n_bits - 1)] * (f_states - n_states))
if (depth == 1):
children = [((x >> i) & 1) for x in children]
else:
children = [mapping[x] for x in children]
if (n_states < f_states):
children += ([max(0, (depth - 1) * n_bits - 1)] * (f_states - n_states))
idepth = (depth - 1) * n_bits
while len(children) > 1:
......
Markdown is supported
0% or
You are about to add 0 people to the discussion. Proceed with caution.
Finish editing this message first!
Please register or to comment