Esempio n. 1
0
        public Solution getBestUndeveloped()
        {
            int      i = 40;
            Solution l_bestSolution = null;

            while (i >= 0 && l_bestSolution == null)
            {
                if ((c_solutionList[i] as ArrayList).Count > 0)
                {
                    int j = 0;
                    while (j < (c_solutionList[i] as ArrayList).Count && l_bestSolution == null)
                    {
                        SolutionNode l_node = ((c_solutionList[i] as ArrayList)[j++] as SolutionNode);
                        if (!(l_node.isDeveloped()))
                        {
                            l_bestSolution = l_node.getSolution();
                            l_node.setDeveloped();
                        }
                    }
                }
                i--;
            }
            return(l_bestSolution);
        }
Esempio n. 2
0
        public Solution getBestUndeveloped()
        {
            int      i = 40;
            Solution l_bestSolution = null;

            while (i >= 0 && l_bestSolution == null)
            {
                if (c_solutionList[i].Count > 0)
                {
                    int j = 0;
                    while (j < c_solutionList[i].Count && l_bestSolution == null)
                    {
                        SolutionNode l_node = c_solutionList[i][j++];
                        if (!l_node.isDeveloped())
                        {
                            l_bestSolution = l_node.getSolution();
                            l_node.setDeveloped();
                        }
                    }
                }
                i--;
            }
            return(l_bestSolution);
        }