We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
There was an error while loading. Please reload this page.
1 parent c99adf4 commit e7daeddCopy full SHA for e7daedd
stubs/networkx/networkx/algorithms/dag.pyi
@@ -11,6 +11,8 @@ def ancestors(G: Graph[_Node], source: _Node) -> set[_Node]: ...
11
@_dispatch
12
def is_directed_acyclic_graph(G: Graph[_Node]) -> bool: ...
13
14
+def topological_generations(G: Graph[_Node]) -> Generator[list[_Node], None, None]: ...
15
+@_dispatch
16
def topological_sort(G: Graph[_Node]) -> Generator[_Node, None, None]: ...
17
18
def lexicographical_topological_sort(
0 commit comments