Alrighty. First Post. whee.
Anyway, how do I implement a breadth-first search algorithm without using a queue?
Alrighty. First Post. whee.
Anyway, how do I implement a breadth-first search algorithm without using a queue?
Is this a problem out of Art of Computer Programming?
I think it's unsolved?
nope, i'm actually trying to implement breadth-first search without a queue.Originally posted by Nick
Is this a problem out of Art of Computer Programming?
if it's unsolved, then i'm S.O.L.
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.
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.