DFS: Difference between revisions
From charlesreid1
No edit summary |
|||
| Line 2: | Line 2: | ||
Depth first search: | Depth first search: | ||
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== | ||
Revision as of 20:19, 11 June 2017
Depth first search notes
Depth first search:
Graphs:
- see TSP (traveling salesperson problem).
Trees:
Recursion:
- see Recursion for recursion.
Related pages:
- see Category:DFS for more.
Flags
 |
Trees Part of Computer Science Notes
Series on Data Structures Abstract data type: Trees/ADT Concrete implementations: Trees/LinkedTree · Trees/ArrayTree · SimpleTree
Tree Traversal Preorder traversal: Trees/Preorder Postorder traversal: Trees/Postorder In-Order traversal: Binary Trees/Inorder Breadth-First Search: BFS Breadth-First Traversal: BFT Depth-First Search: DFS Depth-First Traversal: DFT OOP Principles for Traversal: Tree Traversal/OOP · Tree Traversal/Traversal Method Template Tree operations: Trees/Operations Performance · Trees/Removal
Tree Applications Finding Minimum in Log N Time: Tree/LogN Min Search
Abstract data type: Binary Trees/ADT Concrete implementations: Binary Trees/LinkedBinTree · Binary Trees/ArrayBinTree Binary Trees/Cheat Sheet · Binary Trees/OOP · Binary Trees/Implementation Notes
|