Perform a topological sort. A common use is to show the dependency order of nodes in a directed acyclic graph.
- Perform a topological sort consistent with a partial sort per line of input separated by blanks:
- display this help and exit
- output version information and exit