Skip to content

Find the shortest path between a source and destination while avoiding obstacles using the Iterative Deepening Depth-First Search (IDDFS) algorithm. Includes a user-friendly GUI.

Notifications You must be signed in to change notification settings

Ilia-Abolhasani/idfs-path-finder

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

3 Commits
 
 
 
 
 
 
 
 
 
 

Repository files navigation

IDFS Path Finder with GUI (C#)

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).

Usage

  1. Clone the repository:
git clone https://github.com/Ilia-Abolhasani/idfs-path-finder.git
  1. Open the solution file (IDFSPathFinder.sln) in your preferred IDE.

  2. Build the solution to compile the code.

  3. Customize the Map class to define the map layout, source, destination, and obstacles.

  4. Run the program to launch the GUI.

  5. Use the GUI to interactively find the shortest path. You can set the source, destination, add obstacles, and visualize the path.

Contributing

Contributions to this project are welcome. If you encounter any issues or have suggestions for improvements, please follow these steps:

  1. Fork the repository.

  2. Create a new branch for your contribution.

  3. Make your changes and commit them.

  4. Push your changes to your forked repository.

  5. Submit a pull request to the main repository.

License

This project is licensed under the MIT License. See the LICENSE file for more information.

About

Find the shortest path between a source and destination while avoiding obstacles using the Iterative Deepening Depth-First Search (IDDFS) algorithm. Includes a user-friendly GUI.

Topics

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published

Languages