threadStart.Invoke(); to new Thread(threadStart).Start();. The first one does not create a new thread.
List<Node> neighbours = new List<Node>(); to neighbours.Clear(); (now this list is a field). GetNeighbours() method is called quite often during path searching, so creating new list every time slows down the algorithm a lot. For me it's 20-25% faster after this change.
Updated A* tutorial using DOTS would be great.
Cheers!
Hi. I've made two minor changes:
threadStart.Invoke();tonew Thread(threadStart).Start();. The first one does not create a new thread.List<Node> neighbours = new List<Node>();toneighbours.Clear();(now this list is a field).GetNeighbours()method is called quite often during path searching, so creating new list every time slows down the algorithm a lot. For me it's 20-25% faster after this change.Updated A* tutorial using DOTS would be great. Cheers!