This project is a Kotlin implementation of percolation simulation using the modified Dijkstra algorithm. The goal of the simulation is to find the most optimal path from top to the bottom while trying to hit as few white squares as possible. The path can only go from top to the bottom and to the sides. The project uses Java Swing library to visualize the path and allows choosing the filling percentage as well as the grid size.
To open and run the project, follow these steps:
- Download or clone the project
git clone https://github.com/nikdim03/Percolation.git
- Open the project in IntelliJ IDEA or your preferred IDE
- Choose filling percentages and the grid size
- Run the
Main.ktfile - The program will generate a field with black and white squares and display the most optimal path from top to bottom in the Java Swing window
This project was tested with the following dependencies:
- Kotlin 1.8.20
- Openjdk 18.0.2.1
This project is licensed under the MIT License. Contributions are welcome and appreciated.