Romania-Search 0.0.3

Multiple search algorithms in Romania map

Romania Search

Romania Search is a college project for Artificial Intelligence subject, where you do a given search method to find and print the way the method goes through two cities in the Romania contry.

The start city is given by the user, but the destination is always Bucharest. You can use the following methods:

- Breadth-first search
- Depth-first search
- Uniform-cost search
- Greedy search
- A* search

Installation

Use the package manager pip to install romania_search

pip install romania_search

Usage

Import RomaniaMap.py and use the search method, giving as parameters start city, search method. Additionally, you can use a third parameter as a boolean to determine if a colorful full path will be printed. Otherwise, only total distance will be displayed.

from romania_search.romania_search import RomaniaMap

#Do a greedy search between Arad and Bucharest and print everything
RomaniaMap.search('Arad', 'greedy', True)

#Do a depth-first search through Zerind and Bucharest and print only total distance
RomaniaMap.search('Zerind', 'dfs')

Each search has it own string, so change the search parameter as follows:

- Breadth-first search - 'bfs'
- Depth-first search - 'dfs'
- Uniform-cost search - 'c_unif'
- Greedy search - 'greedy'
- A* search - 'star'

Author

Raphael Garcia

License

MIT