Clarifications

What does "Process adjacent vertices in alphabetical order" mean:
It means that when processing a node you will adjacent elements to a stack or queue selecting adjacent nodes in alphabetical order. It does not mean the DFS or BFS result will show the nodes in alphabetical order. For example, if node B has nodes E and D as adjacents, then we will add to the stack/queue D, followed by E.