A Java desktop application that calculates the shortest path between two points on a grid using the Breadth-First Search (BFS) algorithm. I built this project to practice implementing algorithms and ...

A Java-based Android application developed to visualize and analyze classical pathfinding algorithms in terms of performance, memory usage, and behavior. This project was developed as a final project ...

Many people are taking care of the service which instantly finds the shortest route to the destination, such as a car navigation application or a smartphone map application, but most people who know ...

Abstract: Pathfinding is widely applied when encountering autonomous driving, mobile robot pathfinding, and so on. Traditional pathfinding algorithms have certain limitations such as high ...