GenerateGraph.Size C# (CSharp) Method

    public int Size()
    {
        return nodes.Count;
    }

    public HeuristicD(GenerateGraph graph)
    {
        heuristicCost = new Dictionary <Node, float>();
        //itemList = new List<GameObject> ();
        //GameObject item = GameObject.Find ("Item1");
        //itemList.Add (item);

        PriorityQueue <Node>     pq          = new PriorityQueue <Node>(graph.Size());
        Dictionary <Node, float> cost_so_far = new Dictionary <Node, float> ();

        pq.queue(0.0f, graph.endNode);
        cost_so_far.Add(graph.endNode, 0.0f);
        while (pq.getSize() > 0)
        {
            Node current = pq.dequeue();
            heuristicCost[current] = cost_so_far[current];
            for (int i = 0; i < current.neighbors.Count; i++)
            {
                float new_cost = cost_so_far[current] + Node.distanceBetweenNodes(current, current.neighbors[i]);
                if (!cost_so_far.ContainsKey(current.neighbors[i]) || new_cost < cost_so_far[current.neighbors[i]])
                {
                    cost_so_far[current.neighbors[i]] = new_cost;
                    pq.queue(new_cost, current.neighbors[i]);
                }
            }
        }
    }