Provide a simple function interface for topological sort in graphlib

Feature or enhancement

Proposal:

The graphlib interface requires 5 function calls in order to get the result of a topological sort.

I believe that the most common user will most likely only need a single function call, i.e.

def topological_sort(graph: dict) -> Iterable[set]: ...

I propose adding this small utility function to graphlib.

Note: there is static_order(), which reduces it to 2 function calls, but it flattens the result, which is a bad default.

Has this already been discussed elsewhere?

This is a minor feature, which does not need previous discussion elsewhere

Links to previous discussion of this feature:

No response

La issue riguarda graphlib e la sua interfaccia static_order() esistente; inizia individuando quell’implementazione e i test di graphlib circostanti. Il lavoro sarà completato quando sarà stata aggiunta l’interfaccia proposta topological_sort(graph) a chiamata singola, con output in insiemi raggruppati, e il suo comportamento sarà coperto dai test.