//===========================================	//Returns true if searchItem is in list	//===========================================	bool search(const Type& searchItem)const	{		nodeType<Type> *current;		bool found = false;		current = first;		while(current != NULL && !found)		{			if(current->info == searchItem)				found = true;			else				current = current->link;		}		return found;	}

struct Node{	bool blocked;	bool visited;	int weight;	Node *parent;	int x, y;	int m_f,m_h,m_g;	bool operator==(const Node& node)const	{		return (x == node.x && y == node.y);	}	bool operator <= (const Node& node)const	{		return( m_f <= node.m_f);	}	const Node& operator=(const Node& rhs)	{		blocked = rhs.blocked;		visited = rhs.visited;		weight = rhs.weight;		x = rhs.x;		y = rhs.y;		parent = rhs.parent;		m_f = rhs.m_f;		m_g = rhs.m_g;		m_h = rhs.m_h;		return *this;	}	bool operator < (const Node& rhs)const	{		return(m_f < rhs.m_f);	}			};

#ifndef _ORDERED_LINKED_LIST_H#define _ORDERED_LINKED_LIST_H//Define the nodetemplate <class Type>struct nodeType{	Type info;	nodeType<Type> *link;};template <class Type>class OrderedLinkedList{public:	OrderedLinkedList()	{		count = 0;		first = NULL;		last = NULL;	}	~OrderedLinkedList()	{		destroyList();	}//end destructor	//===============================================	//Destroys List	//===============================================	void destroyList()	{		nodeType<Type> *temp;		while(first != NULL)		{			temp = first;			first = first->link;			delete temp;		}		last = NULL;		count = 0;	}	//===========================================	//Returns the length of the list	//===========================================	int length()	{		return count;	}	//===========================================	//Returns the info contained at the front of	//the list	//===========================================	Type front()	{		return first->info;	}	//============================================	//Removes the front item from the list	//============================================	void removeFront()	{		if(first != NULL)		{			nodeType<Type> *current;			current = first;			first = first->link;			if(first == NULL)				last = NULL;			delete current;			count--;		}	}	//===========================================	//Returns true if searchItem is in list	//===========================================	bool search(const Type& searchItem)const	{		nodeType<Type> *current;		bool found = false;		current = first;		while(current != NULL && !found)		{			if(current->info == searchItem)				found = true;			else				current = current->link;		}		return found;	}	//========================================================	//Function inserts Node based on < criteria	//========================================================	void insertNode(const Type& newItem)	{		nodeType<Type> *current;//pointer to traverse the list		nodeType<Type> *trailCurrent; //pointer just before current		nodeType<Type> *newNode; //pointer to create new node		bool found;		newNode = new nodeType<Type>;		newNode->info = newItem;		newNode->link = NULL;				if(first == NULL)		{			first = newNode;			count++;		}		else		{			current = first;			found = false;			while(current != NULL && !found)			{				if(current->info < newItem)					found = true;				else				{					trailCurrent = current;					current = current->link;				}			}			if(current == first)			{				newNode->link = first;				first = newNode;				count++;			}			else			{				trailCurrent->link = newNode;				newNode->link = current;				count++;			}					}	}	//==============================================	//Function deletes specific deleteItem from list	//==============================================	void deleteNode(const Type& deleteItem)	{		nodeType<Type> *current;		nodeType<Type> *trailCurrent;		bool found;		if(first == NULL)		{			//Cannot remove from an empty list		}		else		{			current = first;			found = false;			while(current != NULL && !found)			{				if(current->info >= deleteItem)					found = true;				else				{					trailCurrent = current;					current = current->link;				}			}			if (current == NULL)			{				//The item is not in the list			}			else			{				if(current->info == deleteItem)				{					if(first == current)					{						first = first->link;						delete current;					}					else					{						trailCurrent->link = current->link;						delete current;					}					count--;				}				else				{					//Item is not in the list				}			}		}	}//End function	private:	int count;	nodeType<Type> *first;	nodeType<Type> *last;};#endif