def test():
Q = ArrayQueue()
Q.enqueue(5)
Q.enqueue(3)
print(Q.data)
print(Q.dequeue())
print(Q.is_empty())
print(Q.first())
print(Q.data)
def breadthfirst(self):
""" Breadth first iteration of all tree positions """
if not self.is_empty():
fringe = ArrayQueue()
fringe.enqueue(self.root())
while not fringe.is_empty():
p = fringe.dequeue()
yield p
for c in self.children(p):
fringe.enqueue(c)
def breadth_first_search(self, v, reach, label):
aq = ArrayQueue()
reach[v] = label
aq.put(v)
while not aq.is_empty():
w = aq.remove()
p = self.adj_list[w].first_node
while p:
u = p.element.v
if not reach[u]:
aq.put(u)
reach[u] = label
p = p.next
print(reach)
from arrayqueue import ArrayQueue
# sample usage
if __name__ == '__main__':
myq = ArrayQueue()
print(myq.is_empty())
myq.enqueue('hello')
myq.enqueue(7)
print(myq.__len__())
print(myq.dequeue())
