I am thinking about the problem of topological sorting, and am stuck with the following question:
How many different topological orderings does a graph G = (V,E) have if E is the empty set?
Is it 0 because there are no edges, or is it V factorial? Thanks.
