Elixir Map Traversal Optimization Inquiry

Skwyckl presented a code snippet for an Elixir function designed to update the 'toggled?' field of a nested map structure, which represents a forest-like data structure as used in graph theory. The map consists of vertices each containing an 'id', a 'toggled?' boolean, and a list of children vertices in the same format. Although the current implementation using the Enum.map function works, Skwyckl inquires if a more elegant solution exists. Respondents to the query suggested considering lenses for elegance, possibly using the 'lens' library by obrok, or leveraging the 'update_in' function from Elixir's Kernel module for cases where the update fields are known.