Thread: CS Theory Question

  1. #1
    Registered User
    Join Date
    Sep 2001
    Posts
    20

    Thumbs up CS Theory Question

    Alrighty. First Post. whee.

    Anyway, how do I implement a breadth-first search algorithm without using a queue?

  2. #2
    Blank
    Join Date
    Aug 2001
    Posts
    1,034
    Is this a problem out of Art of Computer Programming?
    I think it's unsolved?

  3. #3
    Registered User
    Join Date
    Sep 2001
    Posts
    20
    Originally posted by Nick
    Is this a problem out of Art of Computer Programming?
    nope, i'm actually trying to implement breadth-first search without a queue.

    if it's unsolved, then i'm S.O.L.

  4. #4
    Blank
    Join Date
    Aug 2001
    Posts
    1,034
    I think it is unsolved. I remember someone (not here) mentioning it, was
    a level 50 problem in Art of Computer Programming. I gave the
    problem a 5 minute try but I didn't have any luck.

  5. #5
    Blank
    Join Date
    Aug 2001
    Posts
    1,034
    Well I can't find my source. My only suggestion is if your
    really lucky your local library might cary all of Knuth's volumes and
    you can check for the problem.

Popular pages Recent additions subscribe to a feed

Similar Threads

  1. another do while question
    By kbpsu in forum C++ Programming
    Replies: 3
    Last Post: 03-23-2009, 12:14 PM
  2. Question...
    By TechWins in forum A Brief History of Cprogramming.com
    Replies: 16
    Last Post: 07-28-2003, 09:47 PM
  3. opengl DC question
    By SAMSAM in forum Game Programming
    Replies: 6
    Last Post: 02-26-2003, 09:22 PM
  4. Theory question...
    By Imperito in forum C++ Programming
    Replies: 1
    Last Post: 01-01-2003, 05:58 AM
  5. Question, question!
    By oskilian in forum A Brief History of Cprogramming.com
    Replies: 5
    Last Post: 12-24-2001, 01:47 AM