Table of Contents
This project is a map (graph) generator that incorporates uninformed search algorithms to find the optimal path between two nodes.
-
Map Generation (Graph): The map is generated based on user-defined parameters.
-
Search Algorithms: The program includes both uninformed and informed search algorithms.
-
Map Visualization: Users can visualize the map with or without the route calculated by the algorithm, along with the cost and the path to be taken.
-
Random Values: Each edge has predefined values randomly assigned to them.
To execute the project, please follow the steps below:
It is necessary to have the libraries used in the project installed in your environment. You can install them using pip and the dependency file provided within the project.
- Installing the libraries using pip:
pip install -r requirements.txt
- Creating a virtual environment:
python -m venv venv_name source venv_name/bin/activate
To start the application, run the main.py file:
python main.py
After execution, a window will appear on your screen, containing several fields that need to be filled out:
- Número de PSDP: Defines the number of nodes the graph will have.
- Razão de desconto: A decimal value that controls the discount for PSDP.
- Número de caminhos para cada PSDP: The number of edges at each node.
After filling in the fields, when you click on the 'Gerar Mapa' button, another window will open, displaying the created graph:
When you click the 'Abrir Menu do Road Book' button, a third menu will open, allowing you to choose the starting and ending nodes (PSDP de largada e chegada, respectively), as well as the search algorithm that will be used to determine the optimal path.
After selecting the desired search algorithm, the map with the optimal path will be displayed.
Distributed under the MIT License. See LICENSE.txt
for more information.
Guilherme Weber - [email protected]
Project Link: https://github.com/glweber/busca_fsi