Breadth-First Search - Revision history

Savoundg at 04:42, 3 October 2020

2020-10-03T04:42:27Z

← Older revision		Revision as of 04:42, 3 October 2020
Line 3:		Line 3:
	Unlike Depth-First Search, it looks for the neighbours node first before going for the children.		Unlike Depth-First Search, it looks for the neighbours node first before going for the children.

	The algorithm uses queues to get the list of children of the node's neighbours to visit ~~then~~ is the correct order.		The algorithm uses queues to get the list of children of the node's neighbours to visit them is the correct order.

	BFS is generally better if we want to find the shortest path in a graph.		BFS is generally better if we want to find the shortest path in a graph.

Savoundg at 13:56, 30 September 2020

2020-09-30T13:56:58Z

← Older revision		Revision as of 13:56, 30 September 2020
Line 4:		Line 4:

	The algorithm uses queues to get the list of children of the node's neighbours to visit then is the correct order.		The algorithm uses queues to get the list of children of the node's neighbours to visit then is the correct order.

			BFS is generally better if we want to find the shortest path in a graph.

	== Resources ==		== Resources ==

Savoundg at 22:05, 3 June 2018

2018-06-03T22:05:14Z

← Older revision		Revision as of 22:05, 3 June 2018
Line 4:		Line 4:

	The algorithm uses queues to get the list of children of the node's neighbours to visit then is the correct order.		The algorithm uses queues to get the list of children of the node's neighbours to visit then is the correct order.

			== Resources ==
			{\| class="wikitable"
			!
			\|-
			\|https://en.wikipedia.org/wiki/Breadth-first_search
			\|}

Savoundg at 06:12, 3 June 2018

2018-06-03T06:12:56Z

← Older revision		Revision as of 06:12, 3 June 2018
Line 1:		Line 1:
	The Breadth-First Search is an algorithm that finds if there is a path from one node to another.		The Breadth-First Search is an iterative algorithm that finds if there is a path from one node to another.

	Unlike Depth-First Search, it looks for the neighbours node first before going for the children.		Unlike Depth-First Search, it looks for the neighbours node first before going for the children.

			The algorithm uses queues to get the list of children of the node's neighbours to visit then is the correct order.

Savoundg: Created page with "The Breadth-First Search is an algorithm that finds if there is a path from one node to another. Unlike Depth-First Search, it looks for the neighbours node first before goin..."

2018-06-03T05:39:17Z

Created page with "The Breadth-First Search is an algorithm that finds if there is a path from one node to another. Unlike Depth-First Search, it looks for the neighbours node first before goin..."

New page

The Breadth-First Search is an algorithm that finds if there is a path from one node to another.

Unlike Depth-First Search, it looks for the neighbours node first before going for the children.