/**
 * Kuffner提出的算法中，選擇open表中到起始節點距離最短的節點，
 * now為該節點的引用，
 * position是該節點在open表中的位置
**/

package page;

import java.util.*;

public class BChooseOpen 
{
	public BNodes now=new BNodes();
	
	public  BChooseOpen()
	{
	}
	
	public BChooseOpen(LinkedList open)
	{
		if(open.size()>0)
		{	
			now=(BNodes)open.get(0);
			int nowdis=now.getDistance();  //now節點到初始節點的距離
		
			BNodes result=new BNodes();
			int resdis=0;
	
			for(int i=1;i<open.size();i++)
			{
				result=(BNodes)open.get(i);
				resdis=result.getDistance();
				if(resdis<nowdis)
				{
					now=result;
					nowdis=now.getDistance();
				}
			}
		}
		else
			now=null;
	}

	public BNodes getNode()
	{
		return now;
	}
}