CS 310 Homework 7 solution

$24.99

Original Work ?

Download Details:

  • Name: HW7.zip
  • Type: zip
  • Size: 1.18 MB

Category: You will Instantly receive a download link upon Payment||Click Original Work Button for Custom work

Description

5/5 - (1 vote)

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.