A pathfinding project dedicated to showing off a collection of graph traversal algorithms in a userfriendly Unity application, allowing graph generation/editing, maze generation and algorithm tweaking.
Retrieving, modeling, analyzing, and visualizing all the street networks nodes and applying Dijkstra to find the shortest distance from source to destination.Tested on the ground level with a distance radius of 200km
A pretty cliche project... I know. I saw my friend building his own pathfinder and I decide to flex my own graph theory skills. In a week's time of work, I present to you AsuPathFinder, a fun-sized pathfinding / maze generating sandbox with a ton of playful features. Check it out here: https://asdera.github.io/AsuPathFinder/
The project titled ROAD CONSTRUCTION USING HIGHWAY PLANNING AND OBSTRUCTION PREVENTION aims to address one of the major issues that the Indian road construction department is facing.
BFS, DFS(Recursive & Iterative), Dijkstra, Greedy, & A* Algorithms. These algorithms are used to search the tree and find the shortest path from the starting node to the goal node in the tree.
Program was created as a academic project at Wroclaw University of Science and Technology and allows to determine performance difference between two graph representations in various graph problems.