Java

Column labels to the right: $12345678$

Row labels are below this:

$101100100$

$200011010$

$300001101$

$400100010$

$500000001$

$600000001$

$700100001$

$800000000$

This is an unweighted, directed graph. Adjacency matrix row i denotes the arcs from vertex i$.$

a$)$ Draw the above directed graph in the usual way: vertices drawn as circles with the label written inside, and arcs drawn as arrows from vertex to vertex. You must draw the entire connected graph with all $8$ vertices, or no credit. Hint: Draw vertex $1$ at the top.

b$)$ Write out the vertices in topologically sorted order from left to right, according to the topological sorting algorithm we$$ve studied in class. Also, list out each vertex$$s finishing f time.