Finding Route using Informed/ Uninformed Search
Programming Language : Python
Code Structure :
Shortes route – it is used to find the shortest route from the previous node Find Route function – It calculates the the distance between two nodes if it exists graph class – This class is used to store the nodes, adjacent nodes and cost from previous nodes vertex class – this class is used to store list of all nodes, all the adjacent nodes, distance and visited nodes file input – This is opening files and breaking it. find route function is called print path statements are there
Executing Instructions :- python find_route.py uninf/inf <inputfile.txt> <origin_city> <destination_city> <heuristic.txt>