GitHub - Ahaan-R/Informed-and-Uninformed-Search-Algorithm: The program will compute a route between the origin city and the destination city, and will print out both the length of the route and the list of all cities that lie on that route. It should also display the number of nodes expanded and nodes generated.

Ahaan-R / Informed-and-Uninformed-Search-Algorithm Public

Notifications You must be signed in to change notification settings
Fork 0
Star 1

The program will compute a route between the origin city and the destination city, and will print out both the length of the route and the list of all cities that lie on that route. It should also display the number of nodes expanded and nodes generated.

1 star 0 forks Branches Tags Activity

Star

Notifications

Branches Tags

Name		Name	Last commit message	Last commit date
Latest commit History 4 Commits
PROJECT DESCRIPTION.docx		PROJECT DESCRIPTION.docx
ReadMe.txt		ReadMe.txt
find_route.py		find_route.py

Repository files navigation


Language Used: Python

The code contains mainly two different functions for search:
> Uninformed search using a Uniform Cost Search.
> Informed search using a* search.

Code finds a route if present and if route is not present it displays distance as infinity.

To run the code type:

python find_route.py input_file source destination heuristic_file (for informed search)

python find_route.py input_file source destination (for uninformed search)