Skip to content

[networkx] Use concrete node types for the caveman, ring of cliques, windmill and LFR generators #16661

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 30, 2026
+6 −6
Merged

[networkx] Use concrete node types for the caveman, ring of cliques, windmill and LFR generators #16661

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
12 changes: 6 additions & 6 deletions stubs/networkx/networkx/generators/community.pyi
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -19,11 +19,11 @@ __all__ = [
]

@_dispatchable
def caveman_graph(l: int, k: int) -> Graph[Incomplete]: ...
def caveman_graph(l: int, k: int) -> Graph[int]: ...
@_dispatchable
def connected_caveman_graph(l: int, k: int) -> Graph[Incomplete]: ...
def connected_caveman_graph(l: int, k: int) -> Graph[int]: ...
@_dispatchable
def relaxed_caveman_graph(l: int, k: int, p: float, seed=None) -> Graph[Incomplete]: ...
def relaxed_caveman_graph(l: int, k: int, p: float, seed=None) -> Graph[int]: ...
@_dispatchable
def random_partition_graph(
sizes: list[int], p_in: float, p_out: float, seed=None, directed: bool = False
Expand All @@ -37,9 +37,9 @@ def gaussian_random_partition_graph(
n: int, s: float, v: float, p_in: float, p_out: float, directed: bool = False, seed=None
) -> DiGraph[Incomplete]: ...
@_dispatchable
def ring_of_cliques(num_cliques: int, clique_size: int) -> Graph[Incomplete]: ...
def ring_of_cliques(num_cliques: int, clique_size: int) -> Graph[int]: ...
@_dispatchable
def windmill_graph(n: int, k: int) -> Graph[Incomplete]: ...
def windmill_graph(n: int, k: int) -> Graph[int]: ...
@_dispatchable
def stochastic_block_model(
sizes: list[int],
Expand All @@ -64,4 +64,4 @@ def LFR_benchmark_graph(
tol: float = 1e-07,
max_iters: int = 500,
seed=None,
) -> Graph[Incomplete]: ...
) -> Graph[int]: ...
Loading