Dijkstras algorithm returns all paths to the Start position, since that operation can take a while to complete depending on the amount of nodes we cache the results More...

Public Attributes
Dictionary< string, float >	shortestPath
	Key is the coordinate and value is how long it would take to reach the start position

Dictionary< string, string >	previousNodes
	Key is the coordinate and value is the shortest next path to Start

Detailed Description

Dijkstras algorithm returns all paths to the Start position, since that operation can take a while to complete depending on the amount of nodes we cache the results

The documentation for this struct was generated from the following file:

Assets/Scripts/Grid.cs

Public Attributes

Detailed Description