public class Entry

{

    public static void Main()

    {

    }

}

​

public class LinkedQueue<T>

{

    public Node<T> header;

    public Node<T> last;

    private uint count = 0;

    public uint Count

    {

        get

        {

            return count;

        }

    }

​

    public LinkedQueue()

    {

        header = null;

        last = null;

    }

​

    public void Enqueue(T item, int priority = 1)

    {

        Node<T> node = new Node<T>(item, priority);

        if (header == null)

        {

            header = node;

            last = node;

        }

        else

        {

            Node<T> currentNode = header;

            while ()

            {

            }

        }

​

        count++;

    }

​

    public T Dequeue()

    {

        if (count > 0)

        {

            T data = header.data;

            header = header.nextItem;

            count--;

            return data;

        }

        else

        {

            throw new System.Exception("Queue is empty");

        }

    }

​

    public T[] ToArray()

    {

        T[] arrayForm = new T[count];

        Node<T> currentNode = header;

        int counter = 0;

        while (currentNode != null)

        {

            arrayForm[counter] = currentNode.data;

            currentNode = currentNode.nextItem;

            counter++;

        }

​

        return arrayForm;

    }

}

​

public class Node<T>

{

    public T data;

    public Node<T> nextItem;

    public int priority;

    public Node(T data, int priority)

    {

        this.data = data;

        this.nextItem = null;

        this.priority = priority;

    }

}

​

public class Vertex

{

    public float heuristic;

    public Vector2 position;

}

​

public class Vector2

{

    public float x;

    public float y;

    public Vector2(float x, float y)

    {

        this.x = x;

        this.y = y;

    }

}