print(
"Detta program kommer att hitta vilka ord som ligger längst ifrån ditt startord."
)
startWord = input("Startord:")
startNode = ParentNode(startWord)
dumbTree.put(startNode.value)
queue.put(startNode)
maxDistance = 0
words = []
while not queue.isEmpty():
node = queue.get()
distance = countChain(node)
if distance > maxDistance: #Is this node further away then last node?
maxDistance = countChain(node)
words = [node.value]
elif distance == maxDistance: #Is this node on same distance as last node?
words.append(node.value)
makeChildren(node)
for word in words:
print(word + (" " if word == words[-1] else ", "),
end="") #Printar ord + "," för alla utom sista ordet
print("ligger på avståndet " + str(maxDistance) + " från startordet.")
dumbTree = BST()
queue = LinkedQueue()
sweAlpha = list("abcdefghijklmnopqrstuvwxyzåäö")
with open("texts/word3.txt","r") as wordLines:
for word in wordLines:
word = word.rstrip("\n")
if not sweTree.exists(word):
sweTree.put(word)
print("Detta program kommer hitta den snabbaste vägen mellan två trekaraktärs-ord.")
startWord = input("Startord:")
endWord = input("Slutord:")
startNode = ParentNode(startWord)
dumbTree.put(startNode.value)
queue.put(startNode)
while not queue.isEmpty():
node = queue.get()
makeChildren(node)
print("Ingen möjlig väg. Testa igen med nytt s**t/startord.")
