Can you give a second abstract strategy for producing

1. Can you give a second abstract strategy for producing a topological ordering of the vertices in a directed, acyclic graph using a modification of the recursive strategy for performing a depth-first search of G ?

2. Describe informally how Dijkstra’s Shortest Path Algorithm works.