Problem
1. For what kind of graphs is topological sorting defined?
2. What is a topological order for such a graph?
3. Why is the algorithm for finding shortest distances called greedy?
4. Explain how Prim's algorithm for minimal spanning trees differs from Kruskal's algorithm.