https://github.com/jaynil1611/ads-pro
The project utilises advance data structures and algorithms to find the shortest path in a Maze. There is a competition between BFS & A-Star algorithms to find the shortest path.
https://github.com/jaynil1611/ads-pro
algorihtms astar-algorithm bfs-algorithm datastructures gui java-8
Last synced: 3 months ago
JSON representation
The project utilises advance data structures and algorithms to find the shortest path in a Maze. There is a competition between BFS & A-Star algorithms to find the shortest path.
- Host: GitHub
- URL: https://github.com/jaynil1611/ads-pro
- Owner: Jaynil1611
- Created: 2019-05-16T10:27:47.000Z (about 6 years ago)
- Default Branch: master
- Last Pushed: 2020-12-18T13:00:51.000Z (over 4 years ago)
- Last Synced: 2025-01-24T00:29:20.962Z (5 months ago)
- Topics: algorihtms, astar-algorithm, bfs-algorithm, datastructures, gui, java-8
- Language: Java
- Homepage:
- Size: 554 KB
- Stars: 1
- Watchers: 1
- Forks: 0
- Open Issues: 0
-
Metadata Files:
- Readme: README.md
Awesome Lists containing this project
README
# ADVANCE DATA STRUCTURES
## Introduction
The project utilises advance data structures and algorithms to find the shortest path in a Maze. There is a competition between `BFS` & `A-Star` algorithms to find the shortest path. Main aim of this project is to compare the running time and number of nodes searched by the two algorithms (BFS vs A*) in the process of finding the shortest path in maze.
## Algorithms Compared
```
- Breadth First Search
- A-star (A*)
```
## Technologies Used
- Java
- Canvas GUI
- Java AWT
- Java Swing## Run Application
- Clone the repository
- Compile all the java classes in the repository
- Run the test.java after comiling all classes
- Load the files Sword and Maze to view predefined mazes.## 👤 **Jaynil Gaglani**
- Portfolio: [jaynil.gaglani](https://bit.ly/jaynil-profile)
- Linkedin: [Jaynil Gaglani](https://www.linkedin.com/in/jaynilgaglani/)
- Github: [@Jaynil1611](https://github.com/Jaynil1611)## Show your support
Give a ⭐️ if you like this repository!