[plt-scheme] is a queue data structure already existing in DrScheme?

Explore the data structures section of PLaneT.

On Sat, May 8, 2010 at 11:24 AM, Aniket <akarmarkar at mail.bradley.edu> wrote:
> Basically I need it to do breadth first search given a graph
> , a start node and an end node. Would I convert that graph
> into a tree or would i process it as is?
>
> This is what I am told to do:
> For example,
>
> gt& (bfs graph 'a 'g)
> returns
> (a b d g)
>
> Also I would require a queue to do branch and bound.
> Thanks
>
> _________________________________________________
>  For list-related administrative tasks:
>  http://list.cs.brown.edu/mailman/listinfo/plt-scheme
>



-- 
Jay McCarthy <jay at cs.byu.edu>
Assistant Professor / Brigham Young University
http://teammccarthy.org/jay

"The glory of God is Intelligence" - D&C 93