public void dequeue()
{
if (front != null)
{
front = front.getNext();
}
else
{
rear = null;
}
}
public String display()
{
String nodes = "";
GreedyNode temp = front;
while (temp != null)
{
nodes += temp.getData() + " ";
temp = temp.getNext();
}
return(nodes);
}
public bool isVisited(int data)
{
bool flag = false;
GreedyNode temp = front;
while (temp != null)
{
if (data == temp.getData())
{
flag = true;
break;
}
else
{
temp = temp.getNext();
}
}
return(flag);
}
public int compare()
{
int node = 0;
double heuristic = 0;
if (front != null)
{
GreedyNode temp = front.getNext();
heuristic = front.getFunction();
node = front.getData();
while (temp != null)
{
if (temp.getFunction() < heuristic)
{
heuristic = temp.getFunction();
node = temp.getData();
}
temp = temp.getNext();
}
}
return(node);
}
