Skip to content

[networkx] Return the input graph type from transitive_closure #16556

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Open
dannyshafer wants to merge 1 commit into
base: main
Choose a base branch
from
+4 −3
Open

[networkx] Return the input graph type from transitive_closure #16556

Changes from all commits
Commits
Show all changes
1 commit
Select commit
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
7 changes: 4 additions & 3 deletions stubs/networkx/networkx/algorithms/dag.pyi
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -1,5 +1,6 @@
from _typeshed import Incomplete
from collections.abc import Callable, Generator, Iterable
from typing import Any, TypeVar

from networkx.classes.digraph import DiGraph
from networkx.classes.graph import Graph, _EdgeData, _Node, _NodeData
Expand All @@ -23,6 +24,8 @@ __all__ = [
"dag_to_branching",
]

_G = TypeVar("_G", bound=Graph[Any, Any, Any])

@_dispatchable
def descendants(G: Graph[_Node], source) -> set[_Node]: ...
@_dispatchable
Expand All @@ -40,9 +43,7 @@ def all_topological_sorts(G: DiGraph[_Node]) -> Generator[list[_Node]]: ...
@_dispatchable
def is_aperiodic(G: DiGraph[_Node]) -> bool: ...
@_dispatchable
def transitive_closure(
G: Graph[_Node, _NodeData, _EdgeData], reflexive: bool | None = False
) -> Graph[_Node, _NodeData, _EdgeData]: ...
def transitive_closure(G: _G, reflexive: bool | None = False) -> _G: ...
@_dispatchable
def transitive_closure_dag(
G: DiGraph[_Node, _NodeData, _EdgeData], topo_order: Iterable[Incomplete] | None = None
Expand Down
Loading