Skip to content

Using BFS (Breadth First Search) algorithm to find the shortest distance between two points.

License

Notifications You must be signed in to change notification settings

Crew7Studio/Breadth_First_Search_Simulation

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

12 Commits
 
 
 
 
 
 
 
 

Repository files navigation

BFS(Breadth First Search) Algorithm to find the shortest path



This algorithm can be used in Tower Defense games for Enemy AI to find shortest path between two points

This Unity project uses Breadth First Search algorithm to find the shortest path between 2 points.

BFS is an algorithm to find the shortest path between two points.


HOW TO USE :

Set the transform of START and END point on the script attached to the Node gameobject and press play button. The Player/Enemy will spawn at the starting point and move towar the end point, through the path generated by the BFS algorithm. ( Look in the Youtube video provided )

TOOLS USED :

  • Unity game engine

SCREENSHOTS :

Goto Builds and click on the .exe file to play the game.

About

Using BFS (Breadth First Search) algorithm to find the shortest distance between two points.

Resources

License

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published

Languages