BFS - Revision history

Admin at 15:51, 7 September 2017

2017-09-07T15:51:41Z

← Older revision		Revision as of 15:51, 7 September 2017
Line 14:		Line 14:

	{{TreesFlag}}		{{TreesFlag}}
			{{GraphsFlag}}

	~~[[Category:Queues]]~~
	[[Category:Trees]]		[[Category:Trees]]
			[[Category:Binary Trees]]
			[[Category:Graphs]]

	[[Category:Traversal]]		[[Category:Traversal]]
	[[Category:Algorithms]]		[[Category:Algorithms]]
			[[Category:Queues]]

Admin: /* Breadth-first search using queues */

2017-06-11T20:12:14Z

Breadth-first search using queues

@@ Line 1: / Line 1: @@
 ==Breadth-first search using queues==
-When doing BFS, use a queue.
+When doing BFS, use a queue. The pseudocode looks like this:
 ==Flags==

Admin at 20:03, 11 June 2017

2017-06-11T20:03:27Z

@@ Line 1: / Line 1: @@
-==Breadth-first search - queues==
+==Breadth-first search using queues==
 When doing BFS, use a queue.
@@ Line 12: / Line 12: @@
 add children to queue.

Admin: Created page with "==Breadth-first search - queues== When doing BFS, use a queue. Add the root node to the queue. While the queue is not empty: remove item from queue, perform action on i..."

2017-06-11T20:02:47Z

Created page with "==Breadth-first search - queues== When doing BFS, use a queue. Add the root node to the queue. While the queue is not empty: remove item from queue, perform action on i..."

New page

==Breadth-first search - queues==

When doing BFS, use a queue.

Add the root node to the queue.

While the queue is not empty:

remove item from queue,

perform action on item,

add children to queue.