public PathfindingNode GeneratePath(PathfindingNode start, PathfindingNode destination, PathfindingGraph graph, out bool pathExists)
{
graph.SetDestination(destination);
graph.UpdateNodeDistances();
PathfindingNode current = start;
BinaryPile <PathfindingNode> openNodes = new BinaryPile <PathfindingNode>();
BinaryPile <PathfindingNode> closedNodes = new BinaryPile <PathfindingNode>();
current.Weight = 0;
do
{
foreach (PathfindingNode node in current.Connections)
{
float dist = Vector3.Distance(current.Position, node.Position);
if (openNodes.Contains(node) || closedNodes.Contains(node))
{
if (node.Weight > current.Weight + dist)
{
node.Parent = current;
}
}
else
{
node.Parent = current;
openNodes.Add(node);
}
}
closedNodes.Add(current);
current = openNodes.TakeFirst();
if (current.IsDestination)
{
pathExists = true;
return(current);
}
} while (openNodes.Count > 0);
pathExists = false;
return(closedNodes.FirstElement);
}
// Update is called once per frame
void Update()
{
if (Input.GetKeyDown(KeyCode.Alpha0))
{
aux += "0";
}
if (Input.GetKeyDown(KeyCode.Alpha1))
{
aux += "1";
}
if (Input.GetKeyDown(KeyCode.Alpha2))
{
aux += "2";
}
if (Input.GetKeyDown(KeyCode.Alpha3))
{
aux += "3";
}
if (Input.GetKeyDown(KeyCode.Alpha4))
{
aux += "4";
}
if (Input.GetKeyDown(KeyCode.Alpha5))
{
aux += "5";
}
if (Input.GetKeyDown(KeyCode.Alpha6))
{
aux += "6";
}
if (Input.GetKeyDown(KeyCode.Alpha7))
{
aux += "7";
}
if (Input.GetKeyDown(KeyCode.Alpha8))
{
aux += "8";
}
if (Input.GetKeyDown(KeyCode.Alpha9))
{
aux += "9";
}
if (Input.GetKeyDown(KeyCode.Delete))
{
aux.Remove(aux.Length - 1, 1);
}
if (Input.GetKeyDown(KeyCode.Return))
{
//sortingAlgorithm.Insert(int.Parse(aux));
binaryPile.Add(int.Parse(aux));
aux = "";
}
if (Input.GetKeyDown(KeyCode.Space))
{
int lowestValue = binaryPile.TakeFirst();
print(lowestValue);
}
}
