# Algorithms and Structures can create new Structures From **The Algorithm Design Manual** pg (176). We have the following situation: - We have started with a graph structure (undirected) - By using DFS, we are able to create a tree structure - This tree structure has specific properties, namely that if the root node has two children it must be an articulation point - The intuition here is that the number of a children the root node has is a direct function of the depth first search algorithm! (If we constructed a tree based on BFS, we would get a different tree) > So, this is an example of a **specific algorithm** (set of rules/steps/a procedure) **exploiting** a **certain structure** (the undirected graph) in order to **create a new structure** (the tree) that has **specific properties** (a root node with two children is an articulation point) that are **unique to this algorithm and structure combination**. --- Date: 20211020 Links to: [Big Ideas MOC](Big%20Ideas%20MOC.md) [Algorithms and Data Structures](Algorithms%20and%20Data%20Structures.md) [Constraints in Math and Science](Constraints%20in%20Math%20and%20Science.md) [Algorithms Exploit Constraints](Algorithms%20Exploit%20Constraints.md) Tags: References: * The Algorithm Design Manual, pg (176).