FazBrowse GitHub Viewer | Trending |
URL:
| Home
Tools: [Download Repo ZIP]   [Original HTTPS Page]

[networkx] Return the input graph type from compose_all by dannyshafer · Pull Request #16555 · python/typeshed · GitHub

  1. python
  2. typeshed

Repository navigation

[networkx] Return the input graph type from compose_all #16555

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

Merged
JelleZijlstra merged 1 commit into from
Oct 20, 2026
Conversation 1 Commits 1 Checks 73 Files changed
Merged

[networkx] Return the input graph type from compose_all #16555

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

Filter by extension

Filter by extension .pyi  (1) All 1 file type selected
Viewed files
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Unified
Split
Hide whitespace
Diff view
Unified
Split
Hide whitespace
5 changes: 4 additions & 1 deletion stubs/networkx/networkx/algorithms/operators/all.pyi
Show comments
View file
Open in desktop
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters. Learn more about bidirectional Unicode characters
Show hidden characters
Original file line number Diff line number Diff line change
@@ -1,16 +1,19 @@
from _typeshed import Incomplete
from collections.abc import Iterable
from typing import Any, TypeVar

from networkx.classes.graph import Graph
from networkx.utils.backends import _dispatchable

__all__ = ["union_all", "compose_all", "disjoint_union_all", "intersection_all"]

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

@_dispatchable
def union_all(graphs: Iterable[Incomplete], rename: Iterable[Incomplete] | None = ()) -> Graph[Incomplete]: ...
@_dispatchable
def disjoint_union_all(graphs: Iterable[Incomplete]) -> Graph[Incomplete]: ...
@_dispatchable
def compose_all(graphs: Iterable[Incomplete]) -> Graph[Incomplete]: ...
def compose_all(graphs: Iterable[_G]) -> _G: ...
@_dispatchable
def intersection_all(graphs: Iterable[Incomplete]) -> Graph[Incomplete]: ...
Loading
Back | FazBrowse Home | New Git URL