Skip to content

[networkx] Return the input node type from center, centroid and moral_graph #16602

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
srittau merged 1 commit into from
Oct 23, 2026
+3 −7
Merged

[networkx] Return the input node type from center, centroid and moral_graph #16602

Show file tree
Hide file tree
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
4 changes: 1 addition & 3 deletions stubs/networkx/networkx/algorithms/moral.pyi
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -1,9 +1,7 @@
from _typeshed import Incomplete

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

__all__ = ["moral_graph"]

@_dispatchable
def moral_graph(G: Graph[_Node]) -> Graph[Incomplete]: ...
def moral_graph(G: Graph[_Node]) -> Graph[_Node]: ...
6 changes: 2 additions & 4 deletions stubs/networkx/networkx/algorithms/tree/distance_measures.pyi
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -1,10 +1,8 @@
from _typeshed import Incomplete

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

__all__ = ["center", "centroid"]

def center(G: Graph[_Node]) -> list[Incomplete]: ...
def center(G: Graph[_Node]) -> list[_Node]: ...
@_dispatchable
def centroid(G: Graph[_Node]) -> list[Incomplete]: ...
def centroid(G: Graph[_Node]) -> list[_Node]: ...
Loading