This project provides an implementation of the Iterative Deepening Depth-First Search (IDDFS) algorithm in C#. It aims to find the shortest path between a source and destination while avoiding obstacles, featuring a user-friendly graphical user interface (GUI).
- Clone the repository:
git clone https://github.com/Ilia-Abolhasani/idfs-path-finder.git
-
Open the solution file (
IDFSPathFinder.sln
) in your preferred IDE. -
Build the solution to compile the code.
-
Customize the
Map
class to define the map layout, source, destination, and obstacles. -
Run the program to launch the GUI.
-
Use the GUI to interactively find the shortest path. You can set the source, destination, add obstacles, and visualize the path.
Contributions to this project are welcome. If you encounter any issues or have suggestions for improvements, please follow these steps:
-
Fork the repository.
-
Create a new branch for your contribution.
-
Make your changes and commit them.
-
Push your changes to your forked repository.
-
Submit a pull request to the main repository.
This project is licensed under the MIT License. See the LICENSE file for more information.