1. Show that in a directed network, if each node has indegree at least one, the network contains a directed cycle.
2. Show through an example that a network might have several topological orderings of its nodes. Show that the topological ordering of a network is unique if and only if the network contains a simple directed path passing through all of its nodes.