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? Thanks! -- http://mail.python.org/mailman/listinfo/python-list
