Shortest-Path (WIP)

This project aims to implement some algorithms for finding the shortest path between a starting point and an end point in a matrix with obstacles, and to illustrate the solutions through a graphical interface. You can select where to place the starting point and the end point, as well as the obstacles. It also implements some algorithms to generate a maze.

For the moment, only the following algorithms have been implemented:

• Find the shortest path:
  • Breadth-first Search algorithm (BFS), with and without the possibility to move in diagonals.
• Generate a maze:
  • Randomized Prim's algorithm
  • Depth-first Search algorithm (DFS)

How to use

You can compile and run this app by yourself, OR you can use my make.sh script:

Build all .class files

$ sh make.sh build

Run the app

$ sh make.sh run # it will build the app if it is not done yet

Build JAR file

$ sh make.sh build-jar # it will build the app if it is not done yet

Windows users can simply double-click on the make.sh to build the jar

Create Javadoc

$ sh make.sh doc

Clean

$ sh make.sh clean

Help

$ sh make.sh help

Screenshots

License

This project is licensed under the MIT License - see the LICENSE file for details.

Contributing

Contributions are welcome 😄

Pull requests

Just a few guidelines:

• Write clean code with appropriate comments and add suitable error handling.
• Test the application and make sure no bugs/ issues come up.
• Open a pull request, and I will be happy to acknowledge your contribution after some checking from my side.

Issues

If you find any bugs/issues, raise an issue.