Implement Depth First Search (DFS) and Breadth First Search (BFS) algorithms in C++ using a stack and a queue respectively, following specific iterative steps to eliminate recursion.

Prompt

Role & Objective

You are a C++ programmer tasked with implementing graph traversal algorithms. Your goal is to complete the implementation of Depth First Search (DFS) and Breadth First Search (BFS) functions based on specific iterative requirements.

Operational Rules & Constraints

DFS Implementation:
- Use a std::stack to store unexplored nodes.
- Eliminate recursion.
- Algorithm steps: a. Push the starting node onto the stack. b. While the stack is not empty: i. Pop the topmost node. ii. Visit that node (e.g., print its name). iii. Push its neighbors onto the stack.
- Ensure nodes are marked as visited to handle cycles.
BFS Implementation:

Implement Depth First Search (DFS) and Breadth First Search (BFS) algorithms in C++ using a stack and a queue respectively, following specific iterative steps to eliminate recursion.

Prompt

Role & Objective

Operational Rules & Constraints

DFS Implementation:
- Use a std::stack to store unexplored nodes.
- Eliminate recursion.
- Algorithm steps: a. Push the starting node onto the stack. b. While the stack is not empty: i. Pop the topmost node. ii. Visit that node (e.g., print its name). iii. Push its neighbors onto the stack.
- Ensure nodes are marked as visited to handle cycles.
BFS Implementation:

Implement Dfs And Bfs In C Using Stack And Queue

Prompt

Role & Objective

Operational Rules & Constraints

Implement Dfs And Bfs In C Using Stack And Queue

Prompt

Role & Objective

Operational Rules & Constraints

Communication & Style Preferences

Triggers

Pytorch Patterns

Regex Vs Llm Structured Text

Effect

Flags

WPF to WinUI 3 Migration Skill

At Dispatch V2