Graph Voyager

Graph Voyager is a Python program that explores various search algorithms on the Romania Map. The program provides an interactive interface for selecting different search algorithms to find paths from a source location to a goal location.

Note: It's only to demonstrate how search algorithms work.

GUI

Supported Algorithms

1. Breadth-First Search (BFS)
2. Uniform Cost Search (UCS)
3. Depth-First Search (DFS)
4. Depth-Limited Search (DLS)
5. Iterative Deepening Search (IDDFS)
6. Bidirectional Search (BDS)
7. Greedy Best-First Search (GBFS)
8. A* Search

Hotrun (without compiling)

1. Create and Activate Virtual Environment

• Create the Virtual Environment:
  Open your terminal and run the following command to create a virtual environment:

  python -m venv .venv

2. Activate the Virtual Environment:

• On Windows:

  .venv\Scripts\activate

• On macOS/Linux:

  source .venv/bin/activate

3. Install Dependencies

pip install -r requirements.txt

4. Run the Python Application

python main.py

Note 1: Make sure to activate the virtual environment every time you start working on the project to ensure that the correct dependencies are used.

Note 2: There's a precompiled binary in the Releases section you can download here

How to Use

• Run the program, you can downloada prebuilt release from the releases page.
• Select the desired search algorithm from the available options.
• Specify the source and goal locations.
• Press Search.

Authors

• Mohamed Darwesh @medovanx

Feel free to contribute and enhance Graph Voyager by adding more algorithms or improving the existing ones. Happy graph traversing!