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

该 issue 涉及 graphlib 及其现有的 static_order() 接口；首先定位该实现及其周围的 graphlib 测试。完成的标准是添加所提议的单次调用 topological_sort(graph) 接口，使其输出分组集合，并覆盖其行为。