def makeChildren(parentNode, endWord, swedish, q):
alphabet = ['a','b','c','d','e','f','g','h','i','j','k','l','m','n','o','p','q','r','s','t','u','v','w','x','y','z','å','ä','ö']
for i in range(len(parentNode.word)):
wordList = list(parentNode.word)#läs in startordet som en lista för att lättare kunna byta ut bokstäver
for letter in alphabet:
wordList = list(wordList)
wordList[i] = letter
wordList = ''.join(wordList)
child = ParentNode(wordList, parentNode)
if swedish.exists(wordList) and not child.exists():
q.put(child)
if wordList == endWord:
writeChain(child)
## child.printParents()
print('\n')
#sys.exit()
return q
