| http://www.w3.org/ns/prov#value | - 11:12 am, John <rds1@sh163.net> 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*? > Sorry, but you do that all the time ... ask the question as you kno
|
