return out
q = Queue()
-for i in fences:
- q.put(([i], tree))
+# for i in fences:
+# q.put(([i], tree))
+tree[2].remove(3)
+tree[3].remove(2)
+tree[4].remove(5)
+tree[5].remove(4)
+tree[4].remove(7)
+tree[7].remove(4)
+
+q.put(([(2,3),(4,5),(4,7)], tree))
c,seen = q2.get()
if c == i:
loops += 1
- if loops > 1:
- is_solution = False
- break
+ # if loops > 1:
+ # is_solution = False
+ # break
if c in seen:
continue
else:
seen.add(c)
global_seen.add(c)
-
+ print(c, seen)
for j in pen[c]:
q2.put((j,seen.copy()))
# print(c,j,seen, loops)
-
+ print(loops)
+ quit()
if loops == 0:
broken_out = True
for i in current:
output += fences[i]
print(output, current, node_loops)
- quit()
-
-
-
-
-
-
-
+ quit()
# find next
for fence in fences: