A star / Dijkstra / Greedy Best-First-Search / Breadth First Search / Depth First Search
Introduction
This is desktop application with Java Swing, written in Kotlin language
- Visualising find path algorithm: A star, Dijkstra, Greedy Best-First-Search, Breadth First Search, Depth First Search on square cell grid
- Random walls with wall with input percent
- Show closed and open (frontier) cell, current path
Installation
Install as usual, clone repo, and run on IDE