Path Finding Using A* in C# 3.0, Part (blogs.msdn.com)
submitted by 
findmecool(600) 4 years, 7 months ago
In order to make the A* algorithm work we need to get the lowest-estimated-cost-path-discovered-so-far out of the list of paths under consideration. The standard data structure for doing so is called a “priority queue”. Priority queues are so-called because they are typically used to store a list of jobs where each job has an associated priority.
|category: C#
|Views: 20
tags:
C# another
Everyones tags:
Your Tags: