Do a BFS of the undirected graph whose adjacency list is:

s--w--r r--v--s v--r w--s--t--x t--w--x--u u--t--y x--t--w--y y--u--x

where starting vertex is x and vertices are placed on queue in alphabetic order.