On Feb 23, 11:24 am, "John" <[EMAIL PROTECTED]> wrote: > Than C or PASCAL > I mean, list or dictionary in Python are so powerful than the traditional > array. Maybe I can make use of it?
Well, you could wite your own queue manager using Python lists, but ... You have this strange reluctance to look in the documentation. Have you tried Google? Try http://docs.python.org/lib/deque-objects.html Or perhaps you want/need the Queue module or the heapq module. *You* find them and *you* work out what is best for *your* needs. If you have a question that you could not answer yourself, then ask it here. HTH, John > > "John Machin" <[EMAIL PROTECTED]> wrote in message > > news:[EMAIL PROTECTED] > > > On Feb 23, 11:12 am, "John" <[EMAIL PROTECTED]> wrote: > > > I want to write a code for Breadth First Traveral for Graph, which needs > a > > > queue to implement. > > > > I wonder that for such a powerful language as Python, whether there is a > > > better and simpler implementation for a traditional FIFO queue? > > > Better and simpler than *WHAT*? -- http://mail.python.org/mailman/listinfo/python-list
