iterator question

[Jeff]

What is the difference between a depth and a breadth iterator?

[Peter Bui]

If you were to think of a graph as say a binary tree, breadth is when
you move through the tree level by level.

A
/ \
B C
/ \ / \
D E F G

Order would be:
A -> B -> C -> D -> E -> F -> G

Depth is when you head down the tree completely, so for the same example:

A -> B -> D -> E -> C -> F -> G

Of course for a graph, you will want to check whether or not you have
visited the vertex or not since a vertex can end up going back to itself
while traversing through.

Well, this is what I think these two are suppose to mean. If anyone
else thinks differently, let me know ;)