[COLOR="#800080"][B]public void[/B][/COLOR] bfs(){
Queue<Node> q=[COLOR="#800080"][B]new[/B][/COLOR] LinkedList<Node>();
q.add([COLOR="#800080"][B]this[/B][/COLOR].[COLOR="#0000FF"]rootNode[/COLOR]);
printNode([COLOR="#800080"][B]this[/B][/COLOR].[COLOR="#0000FF"]rootNode[/COLOR]);
[COLOR="#0000FF"]rootNode[/COLOR].[COLOR="#0000FF"]visited[/COLOR]=[COLOR="#800080"][B]true[/B][/COLOR];
[COLOR="#800080"][B]while[/B][/COLOR](!q.isEmpty())
{
Node n=(Node)q.remove();
Node child=[COLOR="#800080"][B]null[/B][/COLOR];
[COLOR="#800080"][B]while[/B][/COLOR]((child=getUnvisitedChildNode(n))!=[COLOR="#800080"][B]null[/B][/COLOR])
{
child.[COLOR="#0000FF"]visited[/COLOR]=[COLOR="#800080"][B]true[/B][/COLOR];
printNode(child);
q.add(child);
}
}
clearNodes();
}
1 reply to this topic
#1
Posted 10 December 2011 - 10:07 PM
|
|
|
#2
Posted 12 December 2011 - 04:46 PM
Is there a question?
1 user(s) are reading this topic
0 members, 1 guests, 0 anonymous users


Sign In
Create Account


Back to top









