DFS - Revision history

Admin: /* Flags */

2017-09-07T15:52:04Z

Flags

← Older revision		Revision as of 15:52, 7 September 2017
Line 17:		Line 17:

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

	[[Category:Trees]]		[[Category:Trees]]

Admin: /* Flags */

2017-09-07T15:51:04Z

Flags

← Older revision		Revision as of 15:51, 7 September 2017
Line 18:		Line 18:
	{{TreesFlag}}		{{TreesFlag}}

			[[Category:Trees]]
			[[Category:Binary Trees]]
			[[Category:Graphs]]

			[[Category:Traversal]]
			[[Category:Algorithms]]
	[[Category:Recursion]]		[[Category:Recursion]]
	[[Category:DFS]]		[[Category:DFS]]

Admin at 15:49, 7 September 2017

2017-09-07T15:49:15Z

← Older revision		Revision as of 15:49, 7 September 2017
Line 1:		Line 1:
	==Depth first search notes==		==Depth first search notes==

	Depth first search:		Depth first search utilizes backtracking and recursion to explore each node of a tree, or each vertex of a graph, exactly once.

	~~Graphs:~~		On a graph, depth-first search is a crucial building block of several algorithms related to connectivity, such as finding cycles, determining of two vertices are connected, and constructing spanning trees.
	* see [[TSP]] (traveling salesperson problem).

	~~Trees:~~		For an example of depth-first search on a graph, see [[TSP\|traveling salesperson problem]] page.
	* see [[~~Preorder~~]] ~~or [[Postorder]] or [[Inorder]] for recursive depth-first algorithms for tree traversal~~.
			==Related==

	Recursion:		Recursion:
	* ~~see~~ [[Recursion]] ~~for recursion.~~		* See [[Recursion]]

	~~Related pages:~~		{{TraversalRelated}}
	* see [[:Category:DFS]] for more.

	==Flags==		==Flags==

Admin: /* Depth first search notes */

2017-06-11T20:19:16Z

Depth first search notes

← Older revision		Revision as of 20:19, 11 June 2017
Line 2:		Line 2:

	Depth first search:		Depth first search:
	* see [[Preorder]] or [[Postorder]] or [[Inorder]] for recursive depth-first algorithms for tree traversal.
	* see [[Recursion]] for recursion.
	* see [[:Category:DFS]] for more.

			Graphs:
			* see [[TSP]] (traveling salesperson problem).

			Trees:
			* see [[Preorder]] or [[Postorder]] or [[Inorder]] for recursive depth-first algorithms for tree traversal.

			Recursion:
			* see [[Recursion]] for recursion.

			Related pages:
			* see [[:Category:DFS]] for more.

	==Flags==		==Flags==

Admin at 20:18, 11 June 2017

2017-06-11T20:18:43Z

@@ Line 1: / Line 1: @@
 Depth first search:
 * see [[Preorder]] or [[Postorder]] or [[Inorder]] for recursive depth-first algorithms for tree traversal.
 * see [[Recursion]] for recursion.

Admin: Created page with "Depth first search: * see Preorder or Postorder or Inorder for recursive depth-first algorithms for tree traversal. * see Recursion for recursion."

2017-06-11T20:18:00Z

Created page with "Depth first search: * see Preorder or Postorder or Inorder for recursive depth-first algorithms for tree traversal. * see Recursion for recursion."

New page

Depth first search:
* see [[Preorder]] or [[Postorder]] or [[Inorder]] for recursive depth-first algorithms for tree traversal.
* see [[Recursion]] for recursion.