I need help with BFS pseudocode from The Algorithm Design Manual 2nd Edition, Skiena.
Line that says
process vertex u as desired
process edge (u, v) as desired
This depends on what you try to achieve with the algorithm. Those locations are the place where you put code which actually does something application specific.
If you're writing just a test-implementation you can insert console outputs there to see in which order the vertices/edges are processed