Depth-first traversal is easily implemented via a stack, including recursively (via the call stack), while breadth-first traversal is easily implemented via a queue, including corecursively.
The matrix geometric method and matrix analytic methods have allowed queues with phase-type distributed interarrival and service time distributions to be considered.