Gotta question: DFS is normally done with a stack as a data structure, BFS with a queue. if you were to perform a DFS algorithm using a queue as the underlying data sturcture would the result be the same as a BFS

I will respond to your question with two questions of my own:

What If someone says yes? How will you use that little tidbit of opinion?

What if someone says no? How will you use that little tidbit of opinion?



I have a suggestion: Since this is a programming assistance forum, write a program specification.

1. Tell us the nature of the input(s) to the program.
   
   
2. Tell us the nature of the output(s) from the program.
   
   
3. Tell us exactly what the program is supposed to do in the way of processing the input data to obtain the output data.
   
   
4. Instead of asking an ambiguous question about the result, whatever that is, I think that it might be a Good Thing to give us a (simple) example of input data that you would give to the program and the output that you would expect from the program. If you have implemented any part of the assignment, you might show us what you have done so far and ask specific questions about what you have done or what you think you need to do from this point forward.

Then ask any kind of question about implementation details or anything else. Be specific.

Regards,

Dave