Sign Up

Sign Up to our social questions and Answers Engine to ask questions, answer people’s questions, and connect with other people.

Have an account? Sign In

Have an account? Sign In Now

Sign In

Login to our social questions & Answers Engine to ask questions answer people’s questions & connect with other people.

Sign Up Here

Forgot Password?

Don't have account, Sign Up Here

Forgot Password

Lost your password? Please enter your email address. You will receive a link and will create a new password via email.

Have an account? Sign In Now

You must login to ask a question.

Forgot Password?

Need An Account, Sign Up Here

Please briefly explain why you feel this question should be reported.

Please briefly explain why you feel this answer should be reported.

Please briefly explain why you feel this user should be reported.

Sign InSign Up

The Archive Base

The Archive Base Logo The Archive Base Logo

The Archive Base Navigation

  • Home
  • SEARCH
  • About Us
  • Blog
  • Contact Us
Search
Ask A Question

Mobile menu

Close
Ask a Question
  • Home
  • Add group
  • Groups page
  • Feed
  • User Profile
  • Communities
  • Questions
    • New Questions
    • Trending Questions
    • Must read Questions
    • Hot Questions
  • Polls
  • Tags
  • Badges
  • Buy Points
  • Users
  • Help
  • Buy Theme
  • SEARCH
Home/ Questions/Q 153881
In Process

The Archive Base Latest Questions

Editorial Team
  • 0
Editorial Team
Asked: May 11, 20262026-05-11T09:52:47+00:00 2026-05-11T09:52:47+00:00

I want to do a breadth first search of a tree using a Queue

  • 0

I want to do a breadth first search of a tree using a Queue

var q = new Queue<T>();  q.Enqueue(Root);  foreach(T root in q) {   foreach(T t in root.Children)     q.Enqueue(t); } 

However I get a ‘Collection was modified after the enumerator was instantiated.’ Exception.

Is there a C# type that I can do this with?


Edit: a little reading make me thing I might be doing this totally wrong.

Is there a way to use a foreach to dequeue from a Queue?


this works but is ugly (OMHO)

var q = new Queue<T>();  q.Enqueue(Root);  while(q.Count > 0) {   T root = q.Dequeue();   foreach(T t in root.Children)     q.Enqueue(t); } 
  • 1 1 Answer
  • 0 Views
  • 0 Followers
  • 0
Share
  • Facebook
  • Report

Leave an answer
Cancel reply

You must login to add an answer.

Forgot Password?

Need An Account, Sign Up Here

1 Answer

  • Voted
  • Oldest
  • Recent
  • Random
  1. 2026-05-11T09:52:48+00:00Added an answer on May 11, 2026 at 9:52 am

    You can’t enumerate over an IEnumerable and change the same IEnumerable at the same time. I don’t think there is a C# Collection that will allow this.

    • 0
    • Reply
    • Share
      Share
      • Share on Facebook
      • Share on Twitter
      • Share on LinkedIn
      • Share on WhatsApp
      • Report

Sidebar

Related Questions

I just read about the breadth-first search algorithm in the Introduction to Algorithms book
I want to create a Java application bundle for Mac without using Mac. According
I want to log onto Stack Overflow using OpenID, but I thought I'd set
Anyone has a ready implementation of the Reverse Breadth First traversal algorithm in C#?
i want to perform some test by using Json . I am using google
I want to remove all whitespace characters from a multi-line string using regex. What
Want to know what the stackoverflow community feels about the various free and non-free
Want my FireFox at work to be in sync with my FireFox at my
I want to loop over the contents of a text file and do a
I want to assign the decimal variable "trans" to the double variable "this.Opacity". decimal

Explore

  • Home
  • Add group
  • Groups page
  • Communities
  • Questions
    • New Questions
    • Trending Questions
    • Must read Questions
    • Hot Questions
  • Polls
  • Tags
  • Badges
  • Users
  • Help
  • SEARCH

Footer

© 2021 The Archive Base. All Rights Reserved
With Love by The Archive Base

Insert/edit link

Enter the destination URL

Or link to existing content

    No search term specified. Showing recent items. Search or use up and down arrow keys to select an item.