Depth-First Search - Revision history

Savoundg at 13:57, 30 September 2020

2020-09-30T13:57:32Z

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

	To avoid the algorithm to run in circle infinitely, a flag should indicate if the node has been visited once. The algorithm concludes there is a path between two nodes A and B if one of the node's A children has a path to node B. And, obviously each node has a path to itself.		To avoid the algorithm to run in circle infinitely, a flag should indicate if the node has been visited once. The algorithm concludes there is a path between two nodes A and B if one of the node's A children has a path to node B. And, obviously each node has a path to itself.

			DFS is preferred if we want to visit all nodes in a graph.

	== Resources ==		== Resources ==

Savoundg at 22:04, 3 June 2018

2018-06-03T22:04:32Z

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

	To avoid the algorithm to run in circle infinitely, a flag should indicate if the node has been visited once. The algorithm concludes there is a path between two nodes A and B if one of the node's A children has a path to node B. And, obviously each node has a path to itself.		To avoid the algorithm to run in circle infinitely, a flag should indicate if the node has been visited once. The algorithm concludes there is a path between two nodes A and B if one of the node's A children has a path to node B. And, obviously each node has a path to itself.

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

Savoundg at 05:49, 3 June 2018

2018-06-03T05:49:17Z

← Older revision		Revision as of 05:49, 3 June 2018
Line 2:		Line 2:

	This algorithm searches for the node's children first before going to the neighbours.		This algorithm searches for the node's children first before going to the neighbours.

			To avoid the algorithm to run in circle infinitely, a flag should indicate if the node has been visited once. The algorithm concludes there is a path between two nodes A and B if one of the node's A children has a path to node B. And, obviously each node has a path to itself.

Savoundg: Created page with "The Depth-First Search is a recursive algorithm that finds if there is a path from one node to another. This algorithm searches for the node's children first before going to..."

2018-06-03T05:39:15Z

Created page with "The Depth-First Search is a recursive algorithm that finds if there is a path from one node to another. This algorithm searches for the node's children first before going to..."

New page

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

This algorithm searches for the node's children first before going to the neighbours.