Skip to content

NikolaBerovic/Pathfinding_Unity

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

4 Commits
 
 
 
 
 
 
 
 
 
 
 
 

Repository files navigation

Pathfinding_Unity

Simulation of 4 pathfinding algorithm: Breadth First, Dijkstra, Greedy Best First and A*. For algorithms using heursitics usability of 4 heuristics type: Diagonal, Manhattan, Euclidean and Chebyshev.

alt text

Prerequisites

Installation

  • Clone this repo
  git clone https://github.com/NikolaBerovic/Pathfinding_Unity.git
  • Open project with Unity3d 2017.4+

Usage

Default parameters already set, if custom needed:

  1. In Hierarchy->Pathfinder choose pathfinding you want to simulate and heuristics (if uses any)
  • alt text
  1. In Hierarchy->MapData choose texture map from existing or custom made
  • alt text
  1. In Hierarchy->DemoController choose start and end positions (if existing on map)
  • alt text
  1. Simulate!

Licence

  • Free to Use

About

Simulation of Breadth First, Dijkstra, Greedy Best First and A* written in C# for Unity Engine

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

 
 
 

Contributors

Languages