timeResult = UCS.UCS(graf, nSol, timeout=timeout)
if timeResult == "TLE":
print(file + " - UCS : TLE")
g.write("\nTLE\n")
else:
print(file + " - UCS : Success")
g.close()
"""""" """ A* """ """"""
outputFile = os.path.join(outputFolder,
"a_star_" + file) # calea fisierul de iesire
g = open(outputFile, 'w+')
graf = A_star.Graph(fileInfo, g)
A_star.NodParcurgere.gr = graf
timeResult = A_star.a_star(
graf,
nrSolutiiCautate=nSol,
tip_euristica="euristica admisibila 2",
timeout=timeout
) # functia intoarce "TLE" daca nu a rezolvat problema in timp
if timeResult == "TLE":
print(file + " - A* : TLE")
g.write("\nTLE\n")
else:
print(file + " - A* : Success")
g.close()
"""""" """ A* optimizat """ """"""
outputFile = os.path.join(outputFolder, "a_star_opt_" + file)
g = open(outputFile, 'w+')
graf = A_star.Graph(fileInfo, g)
A_star.NodParcurgere.gr = graf
timeResult = A_star.a_star_optimizat(
graf, tip_euristica="euristica admisibila 2", timeout=timeout)
from Maze import *
import A_star
import sys
from Node import Node
#"AStar": a_star,
size = 15
seed = 2019
maze = getProblemInstance(size, seed)
root = Node(None, None, None, 0, "", 0, size)
root.filler(maze)
root.show_maze()
print("------------------------")
A_star.a_star(root)