## Description

1. Write the vertices in the order encountered during a BFS, starting from vertex A. Break ties

by alphabetical order.

2. Do the same with a DFS, and break ties by reverse alphabetical order.

3. Do a topological sort of the following graph with the edge (H, G) removed.

4. Is the topological sort you found in Problem 3 a unique one? If yes, say so – if no, give another

topological sort.